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 d538b99

Browse files
Merge pull request #55 from prove-ability/main
[2020年05月10日] 정기적 풀이 추가
2 parents dc5f4b3 + f2ca23f commit d538b99

File tree

3 files changed

+48
-1
lines changed

3 files changed

+48
-1
lines changed

‎level-2/구명보트.js‎

Lines changed: 25 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -16,4 +16,28 @@ function solution(people, limit) {
1616
cnt++;
1717
}
1818
return cnt;
19-
} // 4주차 2번 문제와 유사함
19+
} // 4주차 2번 문제와 유사함
20+
21+
// 정답 2- prove-ability
22+
function solution(people, limit) {
23+
let count = 0;
24+
// 오름차순 정렬
25+
people.sort((a, b) => a - b);
26+
27+
// people 배열 요소가 있다면?
28+
while(people.length) {
29+
30+
// 요소 중 가장 큰 수인 마지막 요소를 가져온다
31+
let sum = people.pop();
32+
33+
// 요소 중 가장 작은 수를 더한다
34+
sum += people[0]
35+
36+
// 합이 무게제한보다 작거나 같다면 가장 작은 요소 제거
37+
if(sum <= limit) people.shift();
38+
39+
count++;
40+
}
41+
42+
return count;
43+
}

‎level-2/숫자의-표현.js‎

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -14,4 +14,21 @@ function solution(n) { //수학적 풀이는 별도로 하지 않았습니다.
1414
}
1515
}
1616
return answer;
17+
}
18+
19+
//정답 2 - prove-ability
20+
function solution(n) {
21+
let answer = 0;
22+
for(let i = 1; i <= n; i++) {
23+
let sum = 0;
24+
for(let j = i; j <= n; j++) {
25+
sum += j;
26+
if(sum > n) break;
27+
if(n === sum) {
28+
answer++;
29+
break;
30+
}
31+
}
32+
}
33+
return answer;
1734
}

‎level-2/최댓값과-최솟값.js‎

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -23,4 +23,10 @@ function solution(s) {
2323
let small = s[0] // s의 최솟값
2424
let large = s[s.length - 1] // s의 최댓값
2525
return (small + ' ' + large)
26+
}
27+
28+
//정답 4 - prove-ability
29+
function solution(s) {
30+
s = s.split(" ").map((v) => parseInt(v, 10))
31+
return `${Math.min(...s)} ${Math.max(...s)}`;
2632
}

0 commit comments

Comments
(0)

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