DP2 [Leetcode][Javascript][Medium] 718. Maximum Length of Repeated Subarray /** * https://leetcode.com/problems/maximum-length-of-repeated-subarray/ * https://leetcode.com/explore/challenge/card/july-leetcoding-challenge-2021/609/week-2-july-8th-july-14th/3807/ * @param {number[]} nums1 * @param {number[]} nums2 * @return {number} */ var findLength = function(nums1, nums2) { var maxLength = 0; while (nums1.length > 0) { for (let i=0; i= nums2.length || j >= nums1.length.. 2021. 7. 9. [Leetcode][Javascript][Easy] 70. Climbing Stairs /** * https://leetcode.com/problems/climbing-stairs/ * @param {number} n * @return {number} */ var climbStairs = function(n) { return getSteps(n); }; var memoize = {0: 1, 1: 1, 2: 2, 3: 3}; var getSteps = function(n) { if (memoize[n]) { return memoize[n]; } else if (n < 0) { return 0; } else { var a = getSteps(n-1); var b = getSteps(n-2); if (!memoize[n-1]) { memoize[n-1] = a; } if (!memoize[n-2.. 2021. 7. 6. 이전 1 다음
