Skip to content

[정기적 풀이 추가] 2022年04月13日 1문제 #26

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

codeisneverodd merged 1 commit into main from codeisneverodd

Apr 13, 2022

Merged

[정기적 풀이 추가] 2022年04月13日 1문제 #26

Changes from all commits

Commits

Show all changes

Select commit

Add 삼각-달팽이.js

codeisneverodd Apr 13, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

19 changes: 19 additions & 0 deletions level-2/삼각-달팽이.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,19 @@
	//https://github.com/codeisneverodd/programmers-coding-test
	//완벽한 정답이 아닙니다.
	//정답 1 - codeisneverodd
	function solution(n) {
	const snail = Array.from(Array(n), (_, index) => Array(index + 1));
	let currentNum = 0;
	let [currentRow, currentCol] = [-1, 0];
	let shouldMove = n;
	while (shouldMove > 0) {
	for (let i = 0; i < shouldMove; i++)
	snail[++currentRow][currentCol] = ++currentNum;
	for (let i = 0; i < shouldMove - 1; i++)
	snail[currentRow][++currentCol] = ++currentNum;
	for (let i = 0; i < shouldMove - 2; i++)
	snail[--currentRow][--currentCol] = ++currentNum;
	shouldMove -= 3;
	}
	return snail.flatMap((num) => num);
	}