[LeetCode] (Dynamic Programming) Lv Easy. Climbing Stairs

https://leetcode.com/explore/interview/card/top-interview-questions-easy/97/dynamic-programming/569/

Explore - LeetCode

 

javascript

닫기 줄바꿈

/**
 * @param {number} n
​* @return {number}
​*/
var climbStairs = function (n) {
​​​​const dp = new Map();

​​​​const Climbing = (n) => {
​​​​​​​​if ([1, 2].includes(n)) return n;

​​​​​​​​let n1 = parseInt(n - 1),
​​​​​​​​​​​​n2 = parseInt(n - 2);
​​​​​​​​if (!dp.has(n1)) dp.set(n1, Climbing(n1));
​​​​​​​​if (!dp.has(n2)) dp.set(n2, Climbing(n2));

​​​​​​​​return dp.get(n1) + dp.get(n2);
​​​​};

​​​​return Climbing(n);
};

GitHub : https://github.com/developeSHG/Algorithm-LeetCode/tree/main/climbing-stairs

GitHub - developeSHG/Algorithm-LeetCode: 릿코드 소스코드