week15 ~ week19 완료

Insung-Jo/level_0/머쓱이보다 키 큰 사람.js

@@ -0,0 +1,11 @@
+function solution(array, height) {
+  const answer = array;
+  let result = 0;
+
+  for (let i = 0; i < answer.length; i++) {
+    if (answer[i] > height) {
+      result++;
+    }
+  }
+  return result;
+}

Insung-Jo/level_0/모음 제거.js

@@ -0,0 +1,15 @@
+function solution(my_string) {
+  const gather = ["a", "e", "i", "o", "u"];
+  let answer = my_string.split("");
+
+  for (let i = 0; i < answer.length; i++) {
+    for (let j = 0; j < gather.length; j++) {
+      if (answer[i] === gather[j]) {
+        answer.splice(i, 1);
+        i--;
+      }
+    }
+  }
+
+  return answer.join("");
+}

Insung-Jo/level_0/배열 자르기.js

@@ -0,0 +1,3 @@
+function solution(numbers, num1, num2) {
+  return numbers.slice(num1, num2 + 1);
+}

Insung-Jo/level_0/삼각형의 완성조건 （1）.js

@@ -0,0 +1,7 @@
+function solution(sides) {
+  const sorted = [...sides].sort((a, b) => a - b); // 배열 정렬
+  const max = sorted[2];
+  const shortSum = sorted[0] + sorted[1];
+
+  return max >= shortSum ? 2 : 1;
+}

Insung-Jo/level_0/세균 증식.js

@@ -0,0 +1,9 @@
+function solution(n, t) {
+    let answer = n; 
+
+    for(let i = 1; i <= t; i++){
+        answer *= 2;
+    }
+
+    return answer;
+}

Insung-Jo/level_0/순서쌍의 개수.js

@@ -0,0 +1,11 @@
+function solution(n) {
+    let result = 0;
+
+    for (let i = 1; i * i <= n; i++) {
+        if (n % i === 0) {
+            result++;
+            if (i !== n / i) result++; 
+        }
+    }
+    return result;
+}

Insung-Jo/level_0/아이스 아메리카노.js

@@ -0,0 +1,17 @@
+function solution(money) {
+  const answer = [0, 0];
+  let coffee = 0;
+  let total = 0;
+
+  while (money > 0) {
+    if (money >= 5500) {
+      money -= 5500;
+      answer[0] += 1;
+    } else {
+      answer[1] += money;
+      break;
+    }
+  }
+
+  return answer;
+}

Insung-Jo/level_0/자릿수 더하기.js

@@ -0,0 +1,10 @@
+function solution(n) {
+  const answer = String(n).split("");
+  let result = 0;
+
+  for (let i of answer) {
+    result += Number(i);
+  }
+
+  return result;
+}

Insung-Jo/level_0/점의 위치 구하기.js

@@ -0,0 +1,6 @@
+function solution(dot) {
+  if (dot[0] >= 0 && dot[1] >= 0) return 1;
+  if (dot[0] < 0 && dot[1] >= 0) return 2;
+  if (dot[0] < 0 && dot[1] < 0) return 3;
+  return 4;
+}

Insung-Jo/level_0/최댓값 만들기 (1).js

@@ -0,0 +1,5 @@
+function solution(numbers) {
+  const answer = numbers.sort((a, b) => b - a);
+
+  return answer[0] * answer[1];
+}