Merge pull request #164 from raccoon-ccoder/master

Solve: forEachFilter

Author: pkiop

Challenge/jybaek96/forEachFilter/README.md

@@ -0,0 +1,3 @@
+## 설명
+
+배열 원소중 40 이상인 수만 뽑아 배열을 만드세요.

Challenge/jybaek96/forEachFilter/solve.js

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

Challenge/jybaek96/forEachFilter/solve.test.js

@@ -0,0 +1,12 @@
+const { solution } = require('./solve');
+
+const test1 = {
+  input: [100, 10, 20, 40],
+  answer: [100, 40],
+};
+
+describe('forEachFilter', () => {
+  test('test1', () => {
+    expect(solution(test1.input)).toEqual(test1.answer);
+  });
+});

Challenge/jybaek96/forEachFilterIsNaN/README.md

@@ -0,0 +1,3 @@
+## 설명
+
+배열 원소중 숫자인 원소만 뽑아 배열을 만드세요.

Challenge/jybaek96/forEachFilterIsNaN/solve.js

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

Challenge/jybaek96/forEachFilterIsNaN/solve.test.js

@@ -0,0 +1,28 @@
+const { solution } = require('./solve');
+
+const test1 = {
+  input: [1, 40, '라매', '개발자', 51.5, 'a', 88],
+  answer: [1, 40, 51.5, 88],
+};
+
+const test2 = {
+  input: [1, 2, 3, '4', 5, '6'],
+  answer: [1, 2, 3, 5],
+};
+
+const test3 = {
+  input: [-3, -2, -1, 0, 1, 2, 3],
+  answer: [-3, -2, -1, 0, 1, 2, 3],
+};
+
+describe('forEachFilterIsNaN', () => {
+  test('test1: 숫자,문자 판별', () => {
+    expect(solution(test1.input)).toEqual(test1.answer);
+  });
+  test('test2: 문자로된 숫자 판별', () => {
+    expect(solution(test2.input)).toEqual(test2.answer);
+  });
+  test('test3: 음수 양수 포함', () => {
+    expect(solution(test3.input)).toEqual(test3.answer);
+  });
+});