Skip to content

[2020年05月10日] 정기적 풀이 추가 #55

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

prove-ability merged 5 commits into codeisneverodd:main from prove-ability:main

May 11, 2022

Merged

[2020年05月10日] 정기적 풀이 추가 #55

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

Update 구명보트.js

prove-ability May 6, 2022

Add 최댓값과-최솟값.js

prove-ability May 10, 2022

Add 숫자의-표현.js

prove-ability May 10, 2022

Merge branch 'codeisneverodd:main' into main

prove-ability May 10, 2022

Comment 중첩된 주석 삭제

prove-ability May 11, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

26 changes: 25 additions & 1 deletion level-2/구명보트.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -16,4 +16,28 @@ function solution(people, limit) {
		cnt++;
		}
		return cnt;
	} // 4주차 2번 문제와 유사함
	} // 4주차 2번 문제와 유사함

	// 정답 2- prove-ability
	function solution(people, limit) {
	let count = 0;
	// 오름차순 정렬
	people.sort((a, b) => a - b);

	// people 배열 요소가 있다면?
	while(people.length) {

	// 요소 중 가장 큰 수인 마지막 요소를 가져온다
	let sum = people.pop();

	// 요소 중 가장 작은 수를 더한다
	sum += people[0]

	// 합이 무게제한보다 작거나 같다면 가장 작은 요소 제거
	if(sum <= limit) people.shift();

	count++;
	}

	return count;
	}

17 changes: 17 additions & 0 deletions level-2/숫자의-표현.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -14,4 +14,21 @@ function solution(n) { //수학적 풀이는 별도로 하지 않았습니다.
		}
		}
		return answer;
	}

	//정답 2 - prove-ability
	function solution(n) {
	let answer = 0;
	for(let i = 1; i <= n; i++) {
	let sum = 0;
	for(let j = i; j <= n; j++) {
	sum += j;
	if(sum > n) break;
	if(n === sum) {
	answer++;
	break;
	}
	}
	}
	return answer;
		}

6 changes: 6 additions & 0 deletions level-2/최댓값과-최솟값.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -23,4 +23,10 @@ function solution(s) {
		let small = s[0] // s의 최솟값
		let large = s[s.length - 1] // s의 최댓값
		return (small + ' ' + large)
	}

	//정답 4 - prove-ability
	function solution(s) {
	s = s.split(" ").map((v) => parseInt(v, 10))
	return `${Math.min(...s)} ${Math.max(...s)}`;
		}