updated at 2023. 1. 21. 오후 2:50:54
This commit is contained in:
@@ -5,9 +5,8 @@ class Solution {
|
|||||||
int[] ans = new int[n+1];
|
int[] ans = new int[n+1];
|
||||||
for(int a = 0; a <= n; a++){
|
for(int a = 0; a <= n; a++){
|
||||||
int tmp = 0;
|
int tmp = 0;
|
||||||
if(a == 0) tmp = 1;
|
if(a <= 1) tmp = 1;
|
||||||
if(a >= 1) tmp += ans[a-1];
|
if(a >= 2) tmp += ans[a-2]+ans[a-1];
|
||||||
if(a >= 2) tmp += ans[a-2];
|
|
||||||
ans[a] = tmp%1000000007;
|
ans[a] = tmp%1000000007;
|
||||||
}
|
}
|
||||||
return ans[n];
|
return ans[n];
|
||||||
|
|||||||
Reference in New Issue
Block a user