week15 ~ week19 문제 풀이

yujin-level0/Week13/뒤집힌_문자열.js

@@ -0,0 +1,3 @@
+function solution(my_string) {
+  return my_string.split("").reverse().join("");
+}

yujin-level0/Week13/특정_문자_제거하기.js

@@ -0,0 +1,4 @@
+function solution(my_string, letter) {
+  const answer = my_string.split(letter).join("");
+  return answer;
+}

yujin-level0/Week14/문자_반복_출력하기.js

@@ -0,0 +1,12 @@
+function solution(my_string, n) {
+  var answer = "";
+  for (let i = 0; i < my_string.length; i++) answer += my_string[i].repeat(n);
+
+  return answer;
+}
+
+// 참고용
+// function solution(my_string, n) {
+//   var answer = [...my_string].map((a) => a.repeat(n)).join("");
+//   return answer;
+// }

yujin-level0/Week14/편지.js

@@ -0,0 +1,9 @@
+function solution(message) {
+  const answer = message.length * 2;
+  return answer;
+}
+
+// 다른 풀이
+// function solution(message) {
+//     return message.split('').length * 2;
+// }

yujin-level0/Week15/세균_증식.js

@@ -0,0 +1,12 @@
+function solution(n, t) {
+  let sum = n;
+  for (let i = 0; i < t; i++) {
+    sum *= 2;
+  }
+  return sum;
+}
+
+// 참고용
+// function solution(n, t) {
+//     return n * Math.pow(2, t);
+// }

yujin-level0/Week15/순서쌍의_개수.js

@@ -0,0 +1,13 @@
+function solution(n) {
+  var answer = 0;
+  for (let i = 1; i <= n; i++) {
+    if (n % i === 0) answer += 1;
+  }
+
+  return answer;
+}
+
+// 참고용
+// function solution(n) {
+//       return Array(n).fill(1).map((v,idx) => v + idx).filter(v => n % v === 0).length
+// }

yujin-level0/Week16/모음_제거.js

@@ -0,0 +1,15 @@
+function solution(my_string) {
+  let answer = "";
+  let alpa = ["a", "e", "i", "o", "u"];
+  for (let i = 0; i < my_string.length; i++) {
+    if (!alpa.includes(my_string[i])) {
+      answer += my_string[i];
+    }
+  }
+  return answer;
+}
+
+// 참고용
+// function solution(my_string) {
+//     return Array.from(my_string).filter(t => !['a', 'e', 'i', 'o', 'u'].includes(t)).join('');
+// }

yujin-level0/Week16/최댓값_만들기(1).js

@@ -0,0 +1,12 @@
+function solution(numbers) {
+  let answer = numbers.sort((a, b) => {
+    return b - a;
+  });
+  return answer[0] * answer[1];
+}
+
+// 참고용
+// function solution(numbers) {
+//     numbers.sort((a,b)=>b-a);
+//     return numbers[0]*numbers[1];
+// }

yujin-level0/Week17/머쓱이보다_키_큰_사람.js

@@ -0,0 +1,17 @@
+function solution(array, height) {
+  var answer = 0;
+  for (let i = 0; i < array.length; i++) {
+    if (array[i] > height) {
+      answer++;
+    }
+  }
+  return answer;
+}
+
+// 참고용
+// function solution(array, height) {
+//     var answer = array.filter(item => item > height);
+//     return answer.length;
+// }
+
+// solution([1,2,3,4],2)

yujin-level0/Week17/자릿수_더하기.js

@@ -0,0 +1,17 @@
+function solution(n) {
+  var answer = 0;
+  let j = n;
+  for (let i = 0; i < j; i++) {
+    answer += n % 10;
+    n = Math.floor(n / 10);
+  }
+  return answer;
+}
+
+// 참고용
+// function solution(n) {
+//   return n
+//     .toString()
+//     .split("")
+//     .reduce((acc, cur) => acc + Number(cur), 0);
+// }

yujin-level0/Week18/배열_자르기.js

@@ -0,0 +1,10 @@
+function solution(numbers, num1, num2) {
+  let answer = [];
+  answer = numbers.slice(num1, num2 + 1);
+  return answer;
+}
+
+// 참고용
+// function solution(numbers, num1, num2) {
+//     return numbers.splice(num1, num2-num1+1);
+// }

yujin-level0/Week18/삼각형의_완성조건(1).js

@@ -0,0 +1,4 @@
+function solution(sides) {
+  sides = sides.sort((a, b) => a - b);
+  return sides[0] + sides[1] > sides[2] ? 1 : 2;
+}

yujin-level0/Week19/아이스_아메리카노.js

@@ -0,0 +1,15 @@
+function solution(money) {
+  const americano = 5500;
+
+  const glass = Math.floor(money / americano);
+  const change = money % americano;
+
+  const ans = [glass, change];
+
+  return ans;
+}
+
+// 참고용
+// function solution(money) {
+//     return [Math.floor(money / 5500), money % 5500];
+// }

yujin-level0/Week19/점의_위치_구하기.js

@@ -0,0 +1,12 @@
+function solution(dot) {
+  var answer = 0;
+  if (dot[0] > 0) answer = dot[1] > 0 ? 1 : 4;
+  else answer = dot[1] > 0 ? 2 : 3;
+
+  return answer;
+}
+
+// 참고용
+// function solution(dot) {
+//     return dot[0] > 0 ? dot[1] > 0 ? 1 : 4 : dot[1] > 0 ? 2 : 3;
+// }