Week11 Week12 문제풀이 [전유진]

yujin-level0/Week11/배열_뒤집기.js

@@ -0,0 +1,8 @@
+function solution(num_list) {
+  return num_list.reverse();
+}
+
+// 다른 풀이
+// function solution(num_list) {
+//     return num_list.sort((a, b) => -1);
+// }

yujin-level0/Week11/배열의_평균값.js

@@ -0,0 +1,13 @@
+function solution(numbers) {
+  let sum = 0;
+  for (let i = 0; i < numbers.length; i++) {
+    sum += numbers[i];
+  }
+  return sum / numbers.length;
+}
+
+// 배열 메서드를 이용한 간단 풀이
+// function solution(numbers) {
+//     var answer = numbers.reduce((a,b) => a+b, 0) / numbers.length;
+//     return answer;
+// }

yujin-level0/Week12/제곱수_판별하기.js

@@ -0,0 +1,9 @@
+function solution(n) {
+  const num = Math.sqrt(n);
+  return Number.isInteger(num) ? 1 : 2;
+}
+
+// 다른 정수 판별법
+// function solution(n) {
+//     return Math.sqrt(n) % 1 === 0 ? 1 : 2;
+// }

yujin-level0/Week12/짝수_홀수_개수.js

@@ -0,0 +1,14 @@
+function solution(num_list) {
+  let arr = [0, 0];
+  num_list.forEach((e) => (e % 2 === 0 ? (arr[0] += 1) : (arr[1] += 1)));
+  return arr;
+}
+
+// 짝홀의 위치를 생각한 풀이법
+// function solution(num_list) {
+//     var answer = [0,0];
+//     for(let a of num_list){
+//         answer[a%2] += 1
+//     }
+//     return answer;
+// }