Week 20-21 문제풀이

yujin-level0/Week20/n의_배수_고르기.js

@@ -0,0 +1,15 @@
+function solution(n, numlist) {
+  var answer = [];
+
+  for (let i = 0; i <= numlist.length; i++) {
+    if (numlist[i] % n === 0) {
+      answer.push(numlist[i]);
+    }
+  }
+  return answer;
+}
+
+// 참고용
+// function solution(n, numlist) {
+//   return numlist.filter((num) => num % n === 0);
+// }

yujin-level0/Week20/배열의_유사도.js

@@ -0,0 +1,14 @@
+function solution(s1, s2) {
+  let count = 0;
+  for (i = 0; i < s1.length; i++)
+    if (s2.includes(s1[i])) {
+      count++;
+    }
+  return count;
+}
+
+// 참고용
+// function solution(s1, s2) {
+//     const answer = s1.filter((x) => s2.includes(x));  // s1의원소(x)를 하나씩 필터할건데, s2가 해당 원소를 가지는 것만 빼서 배열로 만든다.
+//     return answer.length;
+// }

yujin-level0/Week21/문자열의_뒤의_n글자.js

@@ -0,0 +1,8 @@
+function solution(my_string, n) {
+  return my_string.slice(-n);
+}
+
+// 참고용
+// function solution(my_string, n) {
+//     return my_string.substring(my_string.length - n);
+// }

yujin-level0/Week21/배열_원소의_길이.js

@@ -0,0 +1,12 @@
+function solution(strlist) {
+  let answer = [];
+  for (let i = 0; i < strlist.length; i++) {
+    answer.push(strlist[i].length);
+  }
+  return answer;
+}
+
+// 참고용
+// function solution(strlist) {
+//     return strlist.map((el) => el.length)
+// }