zumun/Coding-Practice
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

updated at 2023. 1. 31. 오후 11:23:04

Browse Source
This commit is contained in:
rl544
2023-01-31 23:23:05 +09:00
parent 4c74d9681a
commit 5ed46a83a5
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
programmers/삼각 달팽이/solution.java
+1 -1
View File
@@ -12,7 +12,7 @@ class Solution {
while(cnt<max){ while(cnt<max){
switch(state){ switch(state){
case 0: for(a++; a < n-f; a++) job(al,a,b,cnt++); a--; f++; state++; break; case 0: for(a++; a < n-f; a++) job(al,a,b,cnt++); a--; f++; state++; break;
case 1: for(b = f; b < n-2*(f-1); b++) job(al,a,b,cnt++); b--; state++; break; case 1: for(b++; b < n-2*(f-1); b++) job(al,a,b,cnt++); b--; state++; break;
case 2: for(a--,b--; b >= f; a--,b--) job(al,a,b,cnt++); a++;b++; state = 0; break; case 2: for(a--,b--; b >= f; a--,b--) job(al,a,b,cnt++); a++;b++; state = 0; break;
} }
} // for(int d = 0; d < n; d++) System.out.println(Arrays.toString(al.get(d))); } // for(int d = 0; d < n; d++) System.out.println(Arrays.toString(al.get(d)));