[LeetCode/Java] 70. Climbing Stairs

-Code

class Solution {
    public int climbStairs(int n) {
        int before = 0;
        int answer = 1;        

        for (int i = 0; i < n; i++) {
            int temp = answer;
            answer = before + answer;
            before = temp;
        }

        return answer;
    }
}