[LeetCode] 70. Climbing Stairs

- Problem

70. Climbing Stairs

- 내 풀이

class Solution:
    def climbStairs(self, n: int) -> int:
        a, b = 0, 1

        for i in range(n):
            a, b = b, a+b

        return b

- 결과