Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 14 additions & 0 deletions 주중8B/jueun/week04/다음_큰_숫자.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
function solution(n) {
let binary = n.toString(2);
let numOfOnes = binary.split("").filter((el) => el === "1").length;

while (true) {
binary = (++n).toString(2);
let newNumOfOnes = binary.split("").filter((el) => el === "1").length;
if (numOfOnes === newNumOfOnes) {
return n;
}
}

return;
}
34 changes: 34 additions & 0 deletions 주중8B/jueun/week04/체육복.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
function solution(n, lost, reserve) {
// 바로 앞 or 뒷 번호 학생에게만 빌려줄 수 있다...
let students = new Array(n).fill(0);

for (let i = 0; i < reserve.length; i++) {
// students 초기화
students[reserve[i] - 1] = "T";
}
for (let i = 0; i < lost.length; i++) {
if (students[lost[i] - 1] === "T") students[lost[i] - 1] = 0;
else students[lost[i] - 1] = "L";
}

let possible = 0;

for (let i = 0; i < n; i++) {
if (students[i] !== "L") possible++;
}

for (let i = 0; i < n; i++) {
// [ 0, 'L', 'T', 'L', 0 ]
if (students[i] === "L") {
for (let j = i - 1; j <= i + 1; j++) {
if (students[j] === "T") {
possible++;
students[j] = 0;
break;
}
}
}
}

return possible;
}
7 changes: 7 additions & 0 deletions 주중8B/jueun/week04/콜라_문제.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
function solution(a, b, n, answer = 0) {
if (n < a) return answer;
let quotient = parseInt(n / a);
let remainder = n % a;
answer += quotient * b;
return solution(a, b, remainder + quotient * b, answer);
}
7 changes: 7 additions & 0 deletions 주중8B/jueun/week04/피보나치_수.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
function solution(n) {
let fib = [0, 1];
for (let i = 2; i <= n; i++) {
fib[i] = (fib[i - 1] + fib[i - 2]) % 1234567;
}
return fib[n];
}