We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents f2f2a03 + 59dada9 commit c71ef3cCopy full SHA for c71ef3c
lkhyun/202510/01 PGM Lv3 산 모양 타일링.md
@@ -0,0 +1,26 @@
1
+```java
2
+class Solution {
3
+ public int solution(int n, int[] tops) {
4
+ int answer = 0;
5
+ int[][] dp = new int[(n*2)+1][2]; //dp[i][j] = i번째 위치까지 j의 형태로 둔 경우의 수
6
+ //0이면 이후 타일에 영향없음
7
+ //1이면 이후 타일에 영향
8
+ dp[0][0] = 1;
9
+ dp[0][1] = 1;
10
+ for(int i=1;i<n*2;i++){
11
+ if(i%2==0){ //삼각형
12
+ dp[i][0] = (dp[i-1][1] + dp[i-1][0])%10007;
13
+ dp[i][1] = dp[i-1][0];
14
+ }else{ //역삼각형
15
+ if(tops[i/2] == 1){
16
+ dp[i][0] = (dp[i-1][1] + dp[i-1][0]*2)%10007;
17
+ }else{
18
19
+ }
20
21
22
23
+ return (dp[(n*2)-1][0] + dp[(n*2)-1][1]) % 10007;
24
25
+}
26
+```
0 commit comments