목록LeetCode 70. Climbing Stairs c (1)

hahn

[LeetCode - C] 70. Climbing Stairs

Climbing Stairs - LeetCode 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 You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There a..
코딩테스트 연습/LeetCode(C - Easy) 2022. 4. 18. 05:11
이전 Prev 1 Next 다음