Skip to content
Merged
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
9 changes: 5 additions & 4 deletions yujin-level0/Week46/가운데 글자 가져오기.js
Original file line number Diff line number Diff line change
@@ -1,10 +1,11 @@
function solution(s) {
return s.length % 2 === 0
? s[s.length / 2 - 1] + s[s.length / 2]
: s[Math.floor(s.length / 2)];
const mid = s.length / 2;
return s.length % 2 === 0 ? s[mid - 1] + s[mid] : s[Math.floor(mid)];
}

// 다른 풀이
// function solution(s) {
// return s.substr(Math.ceil(s.length / 2) - 1, s.length % 2 ? 1 : 2);
// const mid = Math.floor(s.length / 2);
// // 짝수면 mid-1부터 mid+1까지(2글자), 홀수면 mid부터 mid+1까지(1글자)
// return s.length % 2 !== 0 ? s.slice(mid, mid + 1) : s.slice(mid - 1, mid + 1);
// }
24 changes: 24 additions & 0 deletions yujin-level0/Week47/0 떼기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
function solution(n_str) {
let result = [];
let foundFirstNonZero = false;

for (let i = 0; i < n_str.length; i++) {
// 0이 아닌 숫자 처음 발견 & 그 자리가 0이 아닌 경우
// 0이면 넘어가서 안 담기도록
if (!foundFirstNonZero && n_str[i] !== "0") {
foundFirstNonZero = true;
}

// 0이 아닌 숫자 처음 발견 이후 모든 문자 담기
if (foundFirstNonZero) {
result.push(n_str[i]);
}
}

return result.join("");
}

// 다른 풀이
// function solution(n_str) {
// return String(Number(n_str));
// }
13 changes: 13 additions & 0 deletions yujin-level0/Week47/꼬리 문자열.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
function solution(str_list, ex) {
let answer = "";
str_list.forEach((list) => {
answer += list.includes(ex) ? "" : list;
});
return answer;
}

// 다른 풀이
function solution(str_list, ex) {
// filter는 true를 거르는게 아닌 true를 포함시킴
return str_list.filter((str) => !str.includes(ex)).join("");
}
4 changes: 4 additions & 0 deletions yujin-level0/Week47/제일 작은 수 제거하기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
function solution(arr) {
let min = Math.min(...arr);
return arr.length <= 1 ? [-1] : arr.filter((n) => n !== min);
}
Loading