LeetCode題目: 2966. Divide Array Into Arrays With Max Difference My solution: /** * @param {number[]} nums * @param {number} k * @return {number[][]} */ ...

LeetCode題目: 35. Search Insert Position My solution: /** * @param {number[]} nums * @param {number} target * @return {number} */ let searchInsert = (num...

LeetCode題目: 3423. Maximum Difference Between Adjacent Elements in a Circular Array My solution: /** * @param {number[]} nums * @return {number} */ let m...

LeetCode題目: 3024. Type of Triangle My solution: /** * @param {number[]} nums * @return {string} */ let triangleType = nums => { if(nums.length !=...

LeetCode題目: 128. Longest Consecutive Sequence My solution: /** * @param {number[]} nums * @return {number} */ let longestConsecutive = nums => { ...