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 2926531

Browse files
Merge branch 'cruelladevil-readme-test' into github-action
2 parents 78c906c + 793388e commit 2926531

File tree

7 files changed

+75
-39
lines changed

7 files changed

+75
-39
lines changed

‎README.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
# 프로그래머스 모든 문제 풀이
2+
23
[![방문자수](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https://github.com/codeisneverodd/programmers-coding-test&count_bg=%2379C83D&title_bg=%23555555&icon=&icon_color=%23E7E7E7&title=방문자수(Today/Total)&edge_flat=true)](https://github.com/codeisneverodd)
34

45
🌱 프로그래머스의 [코딩테스트 문제](https://programmers.co.kr/learn/challenges?tab=all_challenges)의 문제 풀이를 찾으실 수 있습니다.
56

6-
🌱 모든 문제는 JavaScript로 풀이되며, 원하는 풀이는 아래에서 검색을 통해 찾으실 수 있습니다
7+
🌱 모든 문제는 JavaScript로 풀이되며, 원하는 풀이는 아래에서 검색을 통해 찾으실 수 있습니다
78

89
[![thumbnail-coding-test-no-id](https://user-images.githubusercontent.com/54318460/158711288-5fbd903f-d3b6-4d56-bd1f-9e5946d67d0a.png)
910
](https://github.com/codeisneverodd/programmers-coding-test/)
1011

11-
1212
## 😁 **도움이 되셨다면** 오른쪽 상단 ↗ 의 ⭐️ **Star를 클릭**해 이 프로젝트를 응원해주세요!
1313

1414
## Control + F 혹은 Cmd + F 를 통해 원하는 문제의 풀이를 찾아보세요!
@@ -170,7 +170,9 @@
170170

171171

172172
## 🙏🏻 아직 풀리지 않은 문제의 해답을 추가해 주세요!
173+
173174
### 커밋 컨벤션
175+
174176
| 접두어 | 작업 내용 |
175177
| ------- | -------------------------------------------------- |
176178
| Create | 새로운 파일 생성 후 문제풀이 코드를 추가 할 경우 |

‎level-1/K번째수.js

Lines changed: 36 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -2,32 +2,46 @@
22
//완벽한 정답이 아닙니다.
33
//정답 1 - codeisneverodd
44
function solution(array, commands) {
5-
var answer = [];
6-
answer = commands.map(cmd => {
7-
const arrCmd = array.slice(cmd[0] - 1, cmd[1]).sort((a, b) => a - b)
8-
return arrCmd[cmd[2] - 1]
9-
})
10-
return answer;
5+
var answer = [];
6+
answer = commands.map((cmd) => {
7+
const arrCmd = array.slice(cmd[0] - 1, cmd[1]).sort((a, b) => a - b);
8+
return arrCmd[cmd[2] - 1];
9+
});
10+
return answer;
1111
}
1212

1313
//정답 2 - jaewon1676
1414
function solution(array, commands) {
15-
var result = [];
16-
var temp = [];
17-
for(var i=0; i<commands.length; i++){
18-
temp = array.slice(commands[i][0] - 1, commands[i][1]).sort((a,b) => {returna-b})
19-
console.log(temp)
20-
result.push(temp[commands[i][2]-1])
21-
}
22-
returnresult
15+
var result = [];
16+
var temp = [];
17+
for(var i=0; i<commands.length; i++){
18+
temp = array.slice(commands[i][0] - 1, commands[i][1]).sort((a,b) => {
19+
returna-b;
20+
});
21+
console.log(temp);
22+
result.push(temp[commands[i][2]-1]);
2323
}
24-
24+
return result;
25+
}
26+
2527
// 정답 3 - prove-ability
2628
function solution(array, commands) {
27-
var answer = [];
28-
commands.forEach(([i, j, k]) => {
29-
const su = array.slice(i - 1, j).sort((a, b) => a - b)[k - 1]
30-
answer.push(su)
31-
})
32-
return answer;
33-
}
29+
var answer = [];
30+
commands.forEach(([i, j, k]) => {
31+
const su = array.slice(i - 1, j).sort((a, b) => a - b)[k - 1];
32+
answer.push(su);
33+
});
34+
return answer;
35+
}
36+
37+
//정답 4 - createhb21
38+
39+
function solution(array, commands) {
40+
let answer = [];
41+
for (let i = 0; i < commands.length; i++) {
42+
let eachCommand = commands[i];
43+
let slice = array.slice(eachCommand[0] - 1, eachCommand[1]);
44+
answer.push(slice.sort((a, b) => a - b)[eachCommand[2] - 1]);
45+
}
46+
return answer;
47+
}

‎level-1/모의고사.js

Lines changed: 23 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -58,4 +58,26 @@ function solution(answers) {
5858
}
5959

6060
return result;
61-
}
61+
}
62+
63+
//정답 3 - yongchanson
64+
function solution(answers) {
65+
let score = [];
66+
let answer = [];
67+
let a1 = [1, 2, 3, 4, 5];
68+
let a2 = [2, 1, 2, 3, 2, 4, 2, 5];
69+
let a3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5];
70+
71+
score.push(answers.filter((a, i) => a === a1[i % a1.length]).length);
72+
score.push(answers.filter((a, i) => a === a2[i % a2.length]).length);
73+
score.push(answers.filter((a, i) => a === a3[i % a3.length]).length);
74+
75+
for (let i = 0; i < score.length; i++) {
76+
const max = Math.max(...score);
77+
if (score[i] === max) {
78+
answer.push(i + 1);
79+
}
80+
}
81+
82+
return answer;
83+
}

‎level-1/최대공약수와-최소공배수.js

Lines changed: 12 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,4 +21,15 @@ function solution(n, m) {
2121
let lcm = (n, m) => (n * m) / gcd(n, m);
2222
// 결과 출력
2323
return [gcd(n, m), lcm(n, m)];
24-
}
24+
}
25+
26+
//정답 3 - yongchanson
27+
function solution(a, b) {
28+
let gcd = 0;
29+
for (let i = 1; i <= Math.min(a, b); i++) {
30+
if ((a % i) + (b % i) === 0) {
31+
gcd = i;
32+
}
33+
}
34+
return [gcd, (a / gcd) * b];
35+
}
File renamed without changes.

‎level-2/K-번째수.js

Lines changed: 0 additions & 13 deletions
This file was deleted.
File renamed without changes.

0 commit comments

Comments
(0)

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