updated at 2023. 1. 21. 오후 2:50:54

2023-01-21 14:50:54 +09:00
parent ff8ca6a710
commit 4e363b0999
1 changed files with 2 additions and 3 deletions
@@ -5,9 +5,8 @@ class Solution {
        int[] ans = new int[n+1];
        for(int a = 0; a <= n; a++){
            int tmp = 0;
-            if(a == 0) tmp = 1;
-            if(a >= 1) tmp += ans[a-1];
-            if(a >= 2) tmp += ans[a-2];
+            if(a <= 1) tmp = 1;
+            if(a >= 2) tmp += ans[a-2]+ans[a-1];
            ans[a] = tmp%1000000007;
        }
        return ans[n];