Climbing Stairs를 recursive 아닌 방법으로 풀어보기

전에 Recursive로 풀었던 포스팅

2021.04.08 - [개발 공부/코딩 테스트] - [LeetCode] - Climbing Stairs

[LeetCode] - Climbing Stairs

class Solution {
    public int climbStairs(int n) {
        if (n <= 2) return n;
        int one = 1;
        int two = 2;
        int answer = 0;
        while(n > 2) {
            answer = one + two;
            one = two;
            two = answer;
            n--;
        }
        return answer;
    }
}