Skip to content

[week 7] 주간 결산_연서 #22

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.

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

Open
wants to merge 6 commits into
base: main
Choose a base branch
from
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
3 changes: 3 additions & 0 deletions 연서/week7/level 1/3진법뒤집기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
function solution(n) {
return parseInt(n.toString(3).split("").reverse().join(""), 3);
}
13 changes: 13 additions & 0 deletions 연서/week7/level 1/기사단원의무기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
function solution(number, limit, power) {
let answer = 0;
for (let n = 1; n <= number; n++) {
let count = 0;
for (let j = 1; j * j <= n; j++) {
if (j * j == n) count++;
else if (n % j == 0) count += 2;
}
if (count > limit) count = power;
answer += count;
}
return answer;
}
19 changes: 19 additions & 0 deletions 연서/week7/level 1/소수찾기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
function solution(n) {
// 2부터 n까지의 수로 구성된 Set
const s = new Set();
for (let i = 2; i <= n; i++) {
s.add(i);
}

// 2부터 n의 제곱근보다 작은 최대 정수까지
for (let j = 2; j < Math.sqrt(n); j++) {
// Set에 해당 수가 포함되면
if (s.has(j)) {
// 그 수를 제외하고 그 수의 배수는 모두 삭제
for (let k = j * 2; k <= n; k += j) {
s.delete(k);
}
}
}
return s.size;
}
10 changes: 10 additions & 0 deletions 연서/week7/level 2/다음큰숫자.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function solution(n) {
const cntOneBinary = (num) => num.toString(2).replace(/0/gi, "").length;

let answer = n + 1;

while (answer > n) {
if (cntOneBinary(answer) === cntOneBinary(n)) return answer;
answer++;
}
}
13 changes: 13 additions & 0 deletions 연서/week7/level 2/전화번호목록.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
function solution(phone_book) {
phone_book.sort();

for (let i = 0; i < phone_book.length - 1; i++) {
if (
phone_book[i] === phone_book[i + 1].substring(0, phone_book[i].length)
) {
return false;
}
}

return true;
}
16 changes: 16 additions & 0 deletions 연서/week7/level 2/큰수만들기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
function solution(number, k) {
let stack = [];
for (let i = 0; i < number.length; i++) {
let value = number[i];
//마지막 숫자와 현재 숫자를 비교하며 현재 숫자가 더 크면 해당 숫자를 pop
while (k > 0 && stack[stack.length - 1] < value) {
// 현재 숫자보다 큰 수가 나올때까지 최대 k번 반복
stack.pop();
k--;
}
stack.push(value);
}
// 모든 숫자를 비교한 후 k가 0보다 크면 남은 k만큼 뒤에서 제거
stack.splice(stack.length - k, k);
return stack.join("");
}