Merge pull request #167 from raccoon-ccoder/master

Array 배열 메서드 복습 1차

Author: pkiop

Challenge/jybaek96/everyArray/solve.js

@@ -1,5 +1,5 @@
 function solution(inputArray) {
-    return inputArray.every(item => item % 2 == 0);
+    return inputArray.every(item => item % 2 === 0);
 }
 
 exports.solution = solution;

Challenge/jybaek96/expDivOdd/solve.js

@@ -1,9 +1,8 @@
 function solution(inputArray) {
-    const answer = inputArray
-    .map(item => item * item)
-    .filter(item => item % 3 === 1)
-    .reduce((acc, cur) => acc + cur, 0);
-    return answer;   
+   return inputArray
+   .map(item => item * item)
+   .filter(item => item % 3 === 1)
+   .reduce((prev, cur) => prev + cur);
 }
 
 exports.solution = solution;

Challenge/jybaek96/filterIntersection/solve.js

@@ -1,5 +1,5 @@
 function solution(inputArray1, inputArray2) {
-    return inputArray1.filter((item) => inputArray2.includes(item));
+    return inputArray1.filter(item => inputArray2.includes(item));
 }
 
 exports.solution = solution;

Challenge/jybaek96/forEachFilterIsNaN/solve.js

@@ -1,6 +1,6 @@
 // write your codes
 function solution(inputArray) {
-    return inputArray.filter((item) => item === Number(item));
+    return inputArray.filter(item => typeof item === "number");
 }
 
 exports.solution = solution;

Challenge/jybaek96/mapAppendOrder/solve.js

@@ -1,12 +1,12 @@
 // write your codes
 function solution(inputArray) {
-   let result = inputArray.map((item,index) => {
-       let obj = {};
-       obj.name = item;
-       obj.order = index + 1;
-       return obj;
-   });
-   return result;
+    return inputArray.map((item, idx) => {
+        let obj = {};
+        obj["name"] = item;
+        obj["order"] = idx+1;
+        return obj;
+    });
+
 }
 
 exports.solution = solution;

Challenge/jybaek96/reduceMaxValueNIndex/solve.js

@@ -1,9 +1,9 @@
 // write your codes
 function solution(inputArray) {
     let obj = {};
-    const max = inputArray.reduce((acc, cur) => acc > cur ? acc : cur);
-    obj["maxValue"] = max;
-    obj["idx"] = inputArray.indexOf(max);
+    const maxNum = inputArray.reduce((acc, cur) => acc > cur ? acc : cur, inputArray[0]);
+    obj["maxValue"] = maxNum
+    obj["idx"] = inputArray.indexOf(maxNum);
     return obj;
 }
 

Challenge/jybaek96/reduceNameNickname/solve.js

@@ -3,7 +3,7 @@ function solution(inputArray) {
     return inputArray.reduce((acc, cur) => {
         acc[cur.nickname] = cur.name;
         return acc;
-    },{});
+    }, {});
 }
 
 exports.solution = solution;

Challenge/jybaek96/reduceSum/solve.js

@@ -1,5 +1,5 @@
 // write your codes
 function solution(inputArray) {
-    return inputArray.reduce((pre, acc) => pre + acc, 0);
+    return inputArray.reduce((prev, cur) => prev + cur);
 }
 exports.solution = solution;

Challenge/jybaek96/sortByPriceAndQuantity/solve.js

@@ -1,11 +1,6 @@
 // write your codes
 function solution(inputArray) {
-    return inputArray.sort((a,b) => {
-        if(a.price === b.price){
-            return a.quantity - b.quantity;
-        }
-        return a.price - b.price;
-    });
+    return inputArray.sort((a,b) => a.price - b.price || a.quantity - b.quantity);
 }
 
 exports.solution = solution;