Week48 문제풀이

gpfksdlrn/level0/0_떼기.js

@@ -0,0 +1,9 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/181847
+
+function solution(n_str) {
+  for (let i = 0; i < n_str.length; i++) {
+    if (n_str[i] !== '0') {
+      return n_str.slice(i);
+    }
+  }
+}

gpfksdlrn/level0/꼬리_문자열.js

@@ -0,0 +1,9 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/181841
+
+function solution(str_list, ex) {
+  let answer = '';
+  for (let str of str_list) {
+    if (!str.includes(ex)) answer += str;
+  }
+  return answer;
+}

gpfksdlrn/level0/부분_문자열.js

@@ -0,0 +1,11 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/181842
+
+function solution(str1, str2) {
+  return str2.includes(str1) ? 1 : 0;
+}
+
+// 다른 풀이
+// true → 1, false → 0 변환이 자동으로 일어난다
+/**
+ * return Number(str2.includes(str1));
+ */

gpfksdlrn/level0/부분_문자열인지_확인하기.js

@@ -0,0 +1,5 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/181843
+
+function solution(my_string, target) {
+  return Number(my_string.includes(target));
+}

gpfksdlrn/level1/내적.js

@@ -0,0 +1,12 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/70128
+
+function solution(a, b) {
+  let sum = 0;
+  const len = a.length;
+
+  for (let i = 0; i < len; i++) {
+    sum += a[i] * b[i];
+  }
+
+  return sum;
+}

gpfksdlrn/level1/제일_작은_수_제거하기.js

@@ -0,0 +1,7 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/12935
+
+function solution(arr) {
+    if (arr.length <= 1) return [-1];
+    const min = Math.min(...arr);
+    return arr.filter(num => num !== min);
+}