JAVA_Climbing Stairs_LeetCode 70

JAVA_Climbing Stairs_LeetCode 70 Climbing Stairs 풀이 class Solution { public int climbStairs(int n) { if (n <= 2) { return n; } int prev1 = 1; int prev2 = 2; for (int i = 3; i <= n; i++) { int newValue = prev1 + prev2; prev1 = prev2; prev2 = newValue; } return prev2; } } * 출처 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...

원문링크 : JAVA_Climbing Stairs_LeetCode 70