[LeetCode] 70. Climbing Stairs (JavaScript)

https://leetcode.com/problems/climbing-stairs/ Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 이 문제는 DP문제였다. 메모이제이션을 이용하여 풀 수 있었다. /** * @param {number} n * @return {number} */ let climbStairs = function (n) { let memo = Array.from({ length: n + 1 }, () => 0); memo[1] = 1; memo[2] = 2; function DFS(result) { if (memo[result] > 0) return memo[result]; else { return (memo[result] = DFS(result...

원문링크 : [LeetCode] 70. Climbing Stairs (JavaScript)