Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 0086f7d

Browse files
Merge pull request codeisneverodd#26 from codeisneverodd/codeisneverodd
[정기적 풀이 추가] 2022年04月13日 1문제
2 parents ae66091 + 87620b6 commit 0086f7d

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed

‎level-2/삼각-달팽이.js

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(n) {
5+
const snail = Array.from(Array(n), (_, index) => Array(index + 1));
6+
let currentNum = 0;
7+
let [currentRow, currentCol] = [-1, 0];
8+
let shouldMove = n;
9+
while (shouldMove > 0) {
10+
for (let i = 0; i < shouldMove; i++)
11+
snail[++currentRow][currentCol] = ++currentNum;
12+
for (let i = 0; i < shouldMove - 1; i++)
13+
snail[currentRow][++currentCol] = ++currentNum;
14+
for (let i = 0; i < shouldMove - 2; i++)
15+
snail[--currentRow][--currentCol] = ++currentNum;
16+
shouldMove -= 3;
17+
}
18+
return snail.flatMap((num) => num);
19+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /