diff --git a/Challenge/byu0324/everyArray/README.md b/Challenge/byu0324/everyArray/README.md new file mode 100644 index 00000000..442558f6 --- /dev/null +++ b/Challenge/byu0324/everyArray/README.md @@ -0,0 +1,9 @@ +# 문제제목 + +## 설명 + +every를 이용해서 모든 원소가 짝수인지 아닌지를 판별하세요 + +## Expected Output + +true \ No newline at end of file diff --git a/Challenge/byu0324/everyArray/solve.js b/Challenge/byu0324/everyArray/solve.js new file mode 100644 index 00000000..78a8d129 --- /dev/null +++ b/Challenge/byu0324/everyArray/solve.js @@ -0,0 +1,6 @@ +function solution(inputArray) { + let result = inputArray.every(el => el % 2 === 0); + return result; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/everyArray/solve.test.js b/Challenge/byu0324/everyArray/solve.test.js new file mode 100644 index 00000000..7dac26a4 --- /dev/null +++ b/Challenge/byu0324/everyArray/solve.test.js @@ -0,0 +1,21 @@ +const { solution } = require("./solve"); + +const test1 = { + input: [2, 4, 6, 8, 10], + answer: true, +}; + +const test2 = { + input: [2, 3, 6, 8, 10], + answer: false, +}; + +describe("everyArray", () => { + test("모두 짝수면 true여야 한다.", () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); + + test("홀수가 있으면 false여야 한다.", () => { + expect(solution(test2.input)).toEqual(test2.answer); + }); +}); diff --git a/Challenge/byu0324/expDivOdd/README.md b/Challenge/byu0324/expDivOdd/README.md new file mode 100644 index 00000000..c07ab10b --- /dev/null +++ b/Challenge/byu0324/expDivOdd/README.md @@ -0,0 +1,3 @@ +## 설명 + +제곱한 후 3으로 나눈 나머지가 홀수인 것 을 뽑은 배열의 총 합을 구하세요. diff --git a/Challenge/byu0324/expDivOdd/solve.js b/Challenge/byu0324/expDivOdd/solve.js new file mode 100644 index 00000000..0e420e93 --- /dev/null +++ b/Challenge/byu0324/expDivOdd/solve.js @@ -0,0 +1,7 @@ +function solution(inputArray) { + let num = inputArray.map(a => Math.pow(a, 2)); + let dis = num.filter(a => a % 3 === 1); + return dis.reduce((total, cur) => total += cur); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/expDivOdd/solve.test.js b/Challenge/byu0324/expDivOdd/solve.test.js new file mode 100644 index 00000000..ca37fcc3 --- /dev/null +++ b/Challenge/byu0324/expDivOdd/solve.test.js @@ -0,0 +1,21 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [1, 7, 3, 4, 6], + answer: 66, +}; + +const test2 = { + input: [2, 3, 6, 8, 10], + answer: 168, +}; + +describe('everyArray', () => { + test('1, 7, 3, 4, 6', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); + + test('2, 3, 6, 8, 10', () => { + expect(solution(test2.input)).toEqual(test2.answer); + }); +}); diff --git a/Challenge/byu0324/figureSkating/README.md b/Challenge/byu0324/figureSkating/README.md new file mode 100644 index 00000000..54b85fbd --- /dev/null +++ b/Challenge/byu0324/figureSkating/README.md @@ -0,0 +1,35 @@ +## 설명 + +점수를 계산해서 점수가 높은 순으로 name과 score를 가진 객체의 배열을 출력하세요. +단 실격자는 출력하지 않습니다. + +### 피겨 점수 기준 + +피겨 점수는 ‘기술점수(TES)+예술점수(PCS)-감점’으로 구성된다. + +기술점수(TES·Total Element Score)는 기본점수에 수행점수(GOE·Grade Of Execution)를 합산해 도출한다. + +심판은 선수들이 점프와 스핀의 기술을 제대로 수행하는지 살핀다. 점프에선 회전수를 제대로 지켰는지, 에지를 제대로 사용했는지에 따라 ‘롱 에지’(잘못된 에지 사용)나 ‘다운그레이드’(난이도 하락), ‘어텐션’(주의) 등의 판정을 내린다. 스핀과 스텝시퀀스에 붙는 레벨(1~4)도 이들이 결정한다. + +9명의 심판은 선수들이 미리 제출한 연기 구성표를 기준으로 과제별 기본점수에서 가·감점을 한다. 이른바 ‘GOE’라 불리는 수행점수다. + +쇼트프로그램은 점프 3개, 스핀 3개, 스텝 1개의 수행과제가 반드시 포함돼야 한다. + +예술점수(PCS·Total Program Component Score)는 프로그램의 완성도에 영향을 미치는 스케이팅 기술·동작의 연결·연기·안무·곡 해석 등 5가지를 평가한다. + +마지막으로 감점이 반영된다. 감점 항목이 발생할 때마다 1점씩 감점된다. + +원문보기: +http://news.khan.co.kr/kh_news/khan_art_view.html?art_id=201402172146545#csidx6329aebb6a02152bca884614a7f0544 + +### 판정 기준 + +- 점수가 가장 높은 사람이 1등이다. +- 점수는 기술점수(TES) + 예술점수(PCS) - 감점 으로 구성된다. +- 기술점수(TES)는 기본점수 \* 수행점수(GOE)를 합산해 도출한다. +- 필수 수행과제를 수행하지 못했을 시 실격이다. + +### 필수 수행과제 + +- 쇼트프로그램은 점프 3개, 스핀 3개, 스텝 1개의 수행과제가 반드시 포함돼야 한다. +- 점프와 스핀을 4번 이상 수행했을 시 가장 잘한 3개를 기준으로 한다. diff --git a/Challenge/byu0324/figureSkating/solve.js b/Challenge/byu0324/figureSkating/solve.js new file mode 100644 index 00000000..dd97efcc --- /dev/null +++ b/Challenge/byu0324/figureSkating/solve.js @@ -0,0 +1,38 @@ +// 기본 점수 +const baseScore = { + jump: 10, + spin: 20, + step: 15, +}; + +const baseAssignment = { + jump: 3, + spin: 3, + step: 1, +}; + +// write your codes + +function solution(inputArray) { + let players = inputArray.filter(player => player.goe.jump.length >= baseAssignment.jump && + player.goe.spin.length >= baseAssignment.spin && + player.goe.step.length >= baseAssignment.step); + + players.map(player => { + player.goe.jump.sort((a, b) => b - a).splice(baseAssignment.jump); + player.goe.spin.sort((a, b) => b - a).splice(baseAssignment.spin); + player.goe.step.sort((a, b) => b - a).splice(baseAssignment.step); + + let jumpScore = player.goe.jump.reduce((a, b) => (a + b)) * baseScore.jump; + let spinScore = player.goe.spin.reduce((a, b) => (a + b)) * baseScore.spin; + let stepScore = player.goe.step.reduce((a, b) => (a + b)) * baseScore.step; + + player.score = jumpScore + spinScore + stepScore + player.pcs - player.penalty; + }); + + players.sort((a, b) => b.score - a.score); + + return players.map(player => ({'name': player.name, 'score': player.score})); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/figureSkating/solve.test.js b/Challenge/byu0324/figureSkating/solve.test.js new file mode 100644 index 00000000..c405d5aa --- /dev/null +++ b/Challenge/byu0324/figureSkating/solve.test.js @@ -0,0 +1,46 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [ + { + name: '김연아', + goe: { + jump: [10, 9, 10], + spin: [10, 10, 10], + step: [9], + }, + pcs: 30, + penalty: 0, + }, + { + name: '피겨의 신', + goe: { + jump: [10000, 10000], + spin: [10000, 10000, 10000], + step: [10000], + }, + pcs: 100000, + penalty: 0, + }, + { + name: '아사다 마오', + goe: { + jump: [9, 6, 8, 9], + spin: [9, 9, 9], + step: [8], + }, + pcs: 29, + penalty: 10, + }, + ], + answer: [ + { name: '김연아', score: 1055 }, + { name: '아사다 마오', score: 939 }, + ], +}; + +describe('everyArray', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/filterAge/README.md b/Challenge/byu0324/filterAge/README.md new file mode 100644 index 00000000..873a15c1 --- /dev/null +++ b/Challenge/byu0324/filterAge/README.md @@ -0,0 +1,3 @@ +## 설명 + +배열 원소의 age가 30이상 50미만인 사람만 있는 객체의 배열을 만드세요 diff --git a/Challenge/byu0324/filterAge/solve.js b/Challenge/byu0324/filterAge/solve.js new file mode 100644 index 00000000..63d74999 --- /dev/null +++ b/Challenge/byu0324/filterAge/solve.js @@ -0,0 +1,10 @@ +// write your codes +function solution(inputArray) { + let persons = inputArray.filter(info => + info.age >= 30 && info.age < 50 + ); + + return persons.map(person => ({ 'name': person.name, 'age': person.age })); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/filterAge/solve.test.js b/Challenge/byu0324/filterAge/solve.test.js new file mode 100644 index 00000000..b9081601 --- /dev/null +++ b/Challenge/byu0324/filterAge/solve.test.js @@ -0,0 +1,32 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [ + { + name: '영미', + age: 25, + }, + { + name: '일미', + age: 35, + }, + { + name: '이미', + age: 45, + }, + { + name: '삼미', + age: 55, + }, + ], + answer: [ + { name: '일미', age: 35 }, + { name: '이미', age: 45 }, + ], +}; + +describe('filterAge', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/filterIntersection/README.md b/Challenge/byu0324/filterIntersection/README.md new file mode 100644 index 00000000..d7c9ad39 --- /dev/null +++ b/Challenge/byu0324/filterIntersection/README.md @@ -0,0 +1,5 @@ +# 문제제목 + +## 설명 + +두 배열의 교집합을 출력하세요! diff --git a/Challenge/byu0324/filterIntersection/solve.js b/Challenge/byu0324/filterIntersection/solve.js new file mode 100644 index 00000000..aa68faf6 --- /dev/null +++ b/Challenge/byu0324/filterIntersection/solve.js @@ -0,0 +1,7 @@ +function solution(inputArray1, inputArray2) { + let A = inputArray1.filter(num => inputArray2.includes(num)); + + return A; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/filterIntersection/solve.test.js b/Challenge/byu0324/filterIntersection/solve.test.js new file mode 100644 index 00000000..576cbc86 --- /dev/null +++ b/Challenge/byu0324/filterIntersection/solve.test.js @@ -0,0 +1,15 @@ +const { solution } = require('./solve'); + +const test1 = { + input: { + A: [1, 2, 3, 4, 5], + B: [3, 4, 5, 6, 7], + }, + answer: [3, 4, 5], +}; + +describe('filterIntersection', () => { + test('test1', () => { + expect(solution(test1.input.A, test1.input.B)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/filterOdd/README.md b/Challenge/byu0324/filterOdd/README.md new file mode 100644 index 00000000..cf9eda79 --- /dev/null +++ b/Challenge/byu0324/filterOdd/README.md @@ -0,0 +1,3 @@ +## 설명 + +홀수만 뽑아 배열로 만드세요 diff --git a/Challenge/byu0324/filterOdd/solve.js b/Challenge/byu0324/filterOdd/solve.js new file mode 100644 index 00000000..3a47d17e --- /dev/null +++ b/Challenge/byu0324/filterOdd/solve.js @@ -0,0 +1,6 @@ +// write your codes +function solution(inputArray) { + return inputArray.filter(a => a % 2 == 1); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/filterOdd/solve.test.js b/Challenge/byu0324/filterOdd/solve.test.js new file mode 100644 index 00000000..8cfd7f5a --- /dev/null +++ b/Challenge/byu0324/filterOdd/solve.test.js @@ -0,0 +1,28 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [4, 2, 5, 1, 3], + answer: [5, 1, 3], +}; + +const test2 = { + input: [4, 2, 6, 8, 50, 16], + answer: [], +}; + +const test3 = { + input: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], + answer: [1, 3, 5, 7, 9, 11], +}; + +describe('filterOdd', () => { + 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); + }); +}); diff --git a/Challenge/byu0324/findWord/README.md b/Challenge/byu0324/findWord/README.md new file mode 100644 index 00000000..8ef123f4 --- /dev/null +++ b/Challenge/byu0324/findWord/README.md @@ -0,0 +1,9 @@ +# 문제제목 + +## 설명 + +용가리라는 단어가 있으면 true 없으면 false를 출력 + +## Expected Output + +true diff --git a/Challenge/byu0324/findWord/solve.js b/Challenge/byu0324/findWord/solve.js new file mode 100644 index 00000000..7b606e12 --- /dev/null +++ b/Challenge/byu0324/findWord/solve.js @@ -0,0 +1,5 @@ +// write your codes +function solution(inputArray) { + return inputArray.includes('용가리'); +} +exports.solution = solution; diff --git a/Challenge/byu0324/findWord/solve.test.js b/Challenge/byu0324/findWord/solve.test.js new file mode 100644 index 00000000..804114f6 --- /dev/null +++ b/Challenge/byu0324/findWord/solve.test.js @@ -0,0 +1,26 @@ +const { solution } = require('./solve'); + +const test1 = { + input: ['잠', '자', '고', '싶', '다', '용가리'], + answer: true, +}; +const test2 = { + input: ['맛있는', '용가리치킨'], + answer: false, +}; +const test3 = { + input: ['고질라', '용가리 ', '울트라맨'], + answer: false, +}; + +describe('findWord', () => { + 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); + }); +}); \ No newline at end of file diff --git a/Challenge/byu0324/forEachFilter/README.md b/Challenge/byu0324/forEachFilter/README.md new file mode 100644 index 00000000..6dcbc7c2 --- /dev/null +++ b/Challenge/byu0324/forEachFilter/README.md @@ -0,0 +1,3 @@ +## 설명 + +배열 원소중 40 이상인 수만 뽑아 배열을 만드세요. diff --git a/Challenge/byu0324/forEachFilter/solve.js b/Challenge/byu0324/forEachFilter/solve.js new file mode 100644 index 00000000..c38928b6 --- /dev/null +++ b/Challenge/byu0324/forEachFilter/solve.js @@ -0,0 +1,6 @@ +// write your codes +function solution(inputArray) { + return inputArray.filter(a => a >= 40); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/forEachFilter/solve.test.js b/Challenge/byu0324/forEachFilter/solve.test.js new file mode 100644 index 00000000..3d73b25c --- /dev/null +++ b/Challenge/byu0324/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); + }); +}); diff --git a/Challenge/byu0324/forEachFilterIsNaN/README.md b/Challenge/byu0324/forEachFilterIsNaN/README.md new file mode 100644 index 00000000..570c030e --- /dev/null +++ b/Challenge/byu0324/forEachFilterIsNaN/README.md @@ -0,0 +1,3 @@ +## 설명 + +배열 원소중 숫자인 원소만 뽑아 배열을 만드세요. diff --git a/Challenge/byu0324/forEachFilterIsNaN/solve.js b/Challenge/byu0324/forEachFilterIsNaN/solve.js new file mode 100644 index 00000000..0a73732f --- /dev/null +++ b/Challenge/byu0324/forEachFilterIsNaN/solve.js @@ -0,0 +1,6 @@ +// write your codes +function solution(inputArray) { + return inputArray.filter(a => typeof a == 'number'); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/forEachFilterIsNaN/solve.test.js b/Challenge/byu0324/forEachFilterIsNaN/solve.test.js new file mode 100644 index 00000000..d6e118bb --- /dev/null +++ b/Challenge/byu0324/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); + }); +}); \ No newline at end of file diff --git a/Challenge/byu0324/forEachMap/README.md b/Challenge/byu0324/forEachMap/README.md new file mode 100644 index 00000000..1e8e03c8 --- /dev/null +++ b/Challenge/byu0324/forEachMap/README.md @@ -0,0 +1,3 @@ +## 설명 + +forEach 메소드를 사용해서 배열의 각 원소 끝에 '%'를 붙인 문자열 배열을 출력하세요 diff --git a/Challenge/byu0324/forEachMap/solve.js b/Challenge/byu0324/forEachMap/solve.js new file mode 100644 index 00000000..3d2e3f2e --- /dev/null +++ b/Challenge/byu0324/forEachMap/solve.js @@ -0,0 +1,10 @@ +// write your codes +function solution(inputArray) { + let answer = []; + inputArray.forEach(a => { + answer.push(a + '%'); + }); + return answer; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/forEachMap/solve.test.js b/Challenge/byu0324/forEachMap/solve.test.js new file mode 100644 index 00000000..de4868c6 --- /dev/null +++ b/Challenge/byu0324/forEachMap/solve.test.js @@ -0,0 +1,12 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [100, 10, 20, 40], + answer: ['100%', '10%', '20%', '40%'], +}; + +describe('forEachMap', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/forEachReduce/README.md b/Challenge/byu0324/forEachReduce/README.md new file mode 100644 index 00000000..a984df2d --- /dev/null +++ b/Challenge/byu0324/forEachReduce/README.md @@ -0,0 +1,3 @@ +## 설명 + +forEach 메소드를 사용해서 배열의 총 합을 출력하는 코드를 작성하세요 diff --git a/Challenge/byu0324/forEachReduce/solve.js b/Challenge/byu0324/forEachReduce/solve.js new file mode 100644 index 00000000..372c6ec3 --- /dev/null +++ b/Challenge/byu0324/forEachReduce/solve.js @@ -0,0 +1,8 @@ +// write your codes +function solution(inputArray) { + let answer = 0; + inputArray.forEach(a => answer += a); + return answer; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/forEachReduce/solve.test.js b/Challenge/byu0324/forEachReduce/solve.test.js new file mode 100644 index 00000000..397e4b50 --- /dev/null +++ b/Challenge/byu0324/forEachReduce/solve.test.js @@ -0,0 +1,28 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [100, 10, 20, 40], + answer: 170, +}; + +const test2 = { + input: [120, -20, -30, 0, 15], + answer: 85, +}; + +const test3 = { + input: [-10, -20, -30], + answer: -60, +}; + +describe('forEachReduce', () => { + 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); + }); +}); diff --git a/Challenge/byu0324/mapAddPercent/README.md b/Challenge/byu0324/mapAddPercent/README.md new file mode 100644 index 00000000..75e73042 --- /dev/null +++ b/Challenge/byu0324/mapAddPercent/README.md @@ -0,0 +1,3 @@ +## 설명 + +map 메소드를 사용해 배열 각각 숫자 뒤에 %를 붙인 문자열을 만드세요 diff --git a/Challenge/byu0324/mapAddPercent/solve.js b/Challenge/byu0324/mapAddPercent/solve.js new file mode 100644 index 00000000..fc3c3190 --- /dev/null +++ b/Challenge/byu0324/mapAddPercent/solve.js @@ -0,0 +1,6 @@ +// write your codes +function solution(inputArray) { + return inputArray.map(a => a + '%'); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/mapAddPercent/solve.test.js b/Challenge/byu0324/mapAddPercent/solve.test.js new file mode 100644 index 00000000..dac1b3cc --- /dev/null +++ b/Challenge/byu0324/mapAddPercent/solve.test.js @@ -0,0 +1,12 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [100, 10, 20, 40], + answer: ['100%', '10%', '20%', '40%'], +}; + +describe('mapAddPercent', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/mapAppendOrder/README.md b/Challenge/byu0324/mapAppendOrder/README.md new file mode 100644 index 00000000..1435623a --- /dev/null +++ b/Challenge/byu0324/mapAppendOrder/README.md @@ -0,0 +1,3 @@ +## 설명 + +배열의 값을 name 프로퍼티에 넣고 몇번째 원소인지를 order에 넣은 객체의 배열을 출력하세요 diff --git a/Challenge/byu0324/mapAppendOrder/solve.js b/Challenge/byu0324/mapAppendOrder/solve.js new file mode 100644 index 00000000..cf23028d --- /dev/null +++ b/Challenge/byu0324/mapAppendOrder/solve.js @@ -0,0 +1,8 @@ +// write your codes +function solution(inputArray) { + return inputArray.map(arr => ({ + 'name': arr, 'order': inputArray.indexOf(arr) + 1 + })); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/mapAppendOrder/solve.test.js b/Challenge/byu0324/mapAppendOrder/solve.test.js new file mode 100644 index 00000000..e08db10c --- /dev/null +++ b/Challenge/byu0324/mapAppendOrder/solve.test.js @@ -0,0 +1,16 @@ +const { solution } = require('./solve'); + +const test1 = { + input: ['홍길동', '둘리', '루피'], + answer: [ + { name: '홍길동', order: 1 }, + { name: '둘리', order: 2 }, + { name: '루피', order: 3 }, + ], +}; + +describe('mapAppendOrder', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/recommendAd/README.md b/Challenge/byu0324/recommendAd/README.md new file mode 100644 index 00000000..132e8800 --- /dev/null +++ b/Challenge/byu0324/recommendAd/README.md @@ -0,0 +1,15 @@ +# 문제제목 + +사용자가 안 본 광고는? + +## 설명 + +유튜브는 사용자가 프리미엄 회원이 아닌 경우 영상 시작이나 중간에 광고가 나오도록 설정되어 있습니다. + +[2020년 유튜브 인기 광고](https://www.thinkwithgoogle.com/intl/ko-kr/marketing-strategies/video/%EB%8C%80%ED%95%9C%EB%AF%BC%EA%B5%AD-youtube-%EC%9D%B8%EA%B8%B0-%EA%B4%91%EA%B3%A0%EC%98%81%EC%83%81-2020%EB%85%84-%EC%97%B0%EB%A7%90%EA%B2%B0%EC%82%B0/)는 총 열 편으로, 사용자의 일주일간 광고 시청 이력을 통해 해당 사용자가 일주일 동안 안 본 광고를 그 다음주에 노출함으로써 광고들이 사용자에게 골고루 노출되길 원합니다. + +유저가 매일 유튜브에 접속하여 하루 한 편 이상의 광고를 보았다고 가정할 때, 이 유저가 안 본 광고는 무엇인지 출력해주세요. + +## Expected Output + +[ '동원F&B' ] diff --git a/Challenge/byu0324/recommendAd/solve.js b/Challenge/byu0324/recommendAd/solve.js new file mode 100644 index 00000000..0124acbd --- /dev/null +++ b/Challenge/byu0324/recommendAd/solve.js @@ -0,0 +1,18 @@ +const userHistory = [ + { date: '2020-11-03', watched: ['KT', 'BBQ'] }, + { date: '2020-11-04', watched: ['정관장', 'KT', '딱좋은데이'] }, + { date: '2020-11-05', watched: ['그랑사가', '농심'] }, + { date: '2020-11-06', watched: ['BBQ'] }, + { date: '2020-11-07', watched: ['쌍용자동차', 'BBQ', 'KT'] }, + { date: '2020-11-08', watched: ['켈로그코리아', '빙그레'] }, + { date: '2020-11-09', watched: ['KT', '그랑사가', '빙그레'] }, +]; + +// write your codes +function solution(inputArray) { + let arr = []; + userHistory.forEach(a => arr.push(...a.watched)); + return inputArray.filter(a => !arr.includes(a)); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/recommendAd/solve.test.js b/Challenge/byu0324/recommendAd/solve.test.js new file mode 100644 index 00000000..8a0f6464 --- /dev/null +++ b/Challenge/byu0324/recommendAd/solve.test.js @@ -0,0 +1,23 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [ + '동원F&B', + '정관장', + 'KT', + 'BBQ', + '그랑사가', + '농심', + '딱좋은데이', + '빙그레', + '쌍용자동차', + '켈로그코리아', + ], + answer: ['동원F&B'], +}; + +describe('recommendAd', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/reduceMaxValueNIndex/README.md b/Challenge/byu0324/reduceMaxValueNIndex/README.md new file mode 100644 index 00000000..965bdec6 --- /dev/null +++ b/Challenge/byu0324/reduceMaxValueNIndex/README.md @@ -0,0 +1,3 @@ +## 설명 + +reduce 메소드를 사용해 최댓값의 값을 maxValue에, 해당 값의 index를 idx에 넣은 객체를 출력하세요 diff --git a/Challenge/byu0324/reduceMaxValueNIndex/solve.js b/Challenge/byu0324/reduceMaxValueNIndex/solve.js new file mode 100644 index 00000000..9d1b63cc --- /dev/null +++ b/Challenge/byu0324/reduceMaxValueNIndex/solve.js @@ -0,0 +1,8 @@ +// write your codes +function solution(inputArray) { + let max = inputArray.reduce((acc, cur) => Math.max(acc, cur)); + let maxIdx = inputArray.indexOf(max); + return { maxValue: max, idx: maxIdx }; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/reduceMaxValueNIndex/solve.test.js b/Challenge/byu0324/reduceMaxValueNIndex/solve.test.js new file mode 100644 index 00000000..0daef5b8 --- /dev/null +++ b/Challenge/byu0324/reduceMaxValueNIndex/solve.test.js @@ -0,0 +1,28 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [3, 29, 38, 12, 57, 74, 40, 85, 61], + answer: { maxValue: 85, idx: 7 }, +}; + +const test2 = { + input: [-24, -2, -13, -49, -999999, -17], + answer: { maxValue: -2, idx: 1 }, +}; +//최댓값이 중복일 때에는 먼저 나온 최댓값의 인덱스를 유지하도록 설정하였습니다. +const test3 = { + input: [2, -20, 21, -874, 99, -16, -29, 99], + answer: { maxValue: 99, idx: 4 }, +}; + +describe('reduceMaxValueNIndex', () => { + 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); + }); +}); diff --git a/Challenge/byu0324/reduceNameNickname/README.md b/Challenge/byu0324/reduceNameNickname/README.md new file mode 100644 index 00000000..b6920e05 --- /dev/null +++ b/Challenge/byu0324/reduceNameNickname/README.md @@ -0,0 +1,3 @@ +## 설명 + +입력받은 객채배열의 nickname을 key, name을 value로 하는 객체를 출력하세요 diff --git a/Challenge/byu0324/reduceNameNickname/solve.js b/Challenge/byu0324/reduceNameNickname/solve.js new file mode 100644 index 00000000..eae2a656 --- /dev/null +++ b/Challenge/byu0324/reduceNameNickname/solve.js @@ -0,0 +1,9 @@ +// write your codes +function solution(inputArray) { + return inputArray.reduce((acc, cur) => { + acc[cur.nickname] = cur.name; + return acc; + }, {}); +} + +exports.solution = solution; diff --git a/Challenge/byu0324/reduceNameNickname/solve.test.js b/Challenge/byu0324/reduceNameNickname/solve.test.js new file mode 100644 index 00000000..67b74529 --- /dev/null +++ b/Challenge/byu0324/reduceNameNickname/solve.test.js @@ -0,0 +1,25 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [ + { + name: '홍길동', + nickname: 'hong', + }, + { + name: '둘리', + nickname: '2li', + }, + { + name: '오스트랄로피테쿠스', + nickname: '1Cin', + }, + ], + answer: { hong: '홍길동', '2li': '둘리', '1Cin': '오스트랄로피테쿠스' }, +}; + +describe('reduceNameNickname', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/reduceSum/README.md b/Challenge/byu0324/reduceSum/README.md new file mode 100644 index 00000000..8c607eb2 --- /dev/null +++ b/Challenge/byu0324/reduceSum/README.md @@ -0,0 +1,9 @@ +# 문제제목 + +## 설명 + +reduce 메소드를 사용해서 배열의 모든 수의 합을 구하세요. + +## Expected Output + +106 diff --git a/Challenge/byu0324/reduceSum/solve.js b/Challenge/byu0324/reduceSum/solve.js new file mode 100644 index 00000000..aa273708 --- /dev/null +++ b/Challenge/byu0324/reduceSum/solve.js @@ -0,0 +1,8 @@ +// write your codes +function solution(inputArray) { + return inputArray.reduce((acc, cur) => { acc += cur; + return acc; + }) +} + +exports.solution = solution; diff --git a/Challenge/byu0324/reduceSum/solve.test.js b/Challenge/byu0324/reduceSum/solve.test.js new file mode 100644 index 00000000..046c40cb --- /dev/null +++ b/Challenge/byu0324/reduceSum/solve.test.js @@ -0,0 +1,12 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [10, 3, 20, 5, 8, 60], + answer: 106, +}; + +describe('reduceSum', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/sortByPrice/README.md b/Challenge/byu0324/sortByPrice/README.md new file mode 100644 index 00000000..b1ccf70e --- /dev/null +++ b/Challenge/byu0324/sortByPrice/README.md @@ -0,0 +1,14 @@ +# 문제제목 + +## 설명 + +배열안의 객체를 price를 기준으로 오름차순 정렬한 배열을 출력하세요 + +## Expected Output + +[ + { name: '사과', price: 1000 }, + { name: '당근', price: 2000 }, + { name: '수박', price: 5000 }, + { name: '참외', price: 10000 } +] diff --git a/Challenge/byu0324/sortByPrice/solve.js b/Challenge/byu0324/sortByPrice/solve.js new file mode 100644 index 00000000..584f5935 --- /dev/null +++ b/Challenge/byu0324/sortByPrice/solve.js @@ -0,0 +1,8 @@ +// write your codes +function solution(inputArray) { + inputArray.sort((a, b) => a.price - b.price); + + return inputArray; +} + +exports.solution = solution; \ No newline at end of file diff --git a/Challenge/byu0324/sortByPrice/solve.test.js b/Challenge/byu0324/sortByPrice/solve.test.js new file mode 100644 index 00000000..3d6a3431 --- /dev/null +++ b/Challenge/byu0324/sortByPrice/solve.test.js @@ -0,0 +1,34 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [ + { + name: '사과', + price: 1000, + }, + { + name: '수박', + price: 5000, + }, + { + name: '당근', + price: 2000, + }, + { + name: '참외', + price: 10000, + }, + ], + answer: [ + { name: '사과', price: 1000 }, + { name: '당근', price: 2000 }, + { name: '수박', price: 5000 }, + { name: '참외', price: 10000 }, + ], +}; + +describe('sortByPrice', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/sortByPriceAndQuantity/README.md b/Challenge/byu0324/sortByPriceAndQuantity/README.md new file mode 100644 index 00000000..41cd5c95 --- /dev/null +++ b/Challenge/byu0324/sortByPriceAndQuantity/README.md @@ -0,0 +1,16 @@ +# 문제제목 + +## 설명 + +배열안의 객체를 price를 기준으로 오름차순 정렬한 배열을 출력하세요 +만약 price가 같다면 quantity기준으로 오름차순 정렬하세요 + +## Expected Output + +[ + { name: '사과', price: 1000, quantity: 2 }, + { name: '오이', price: 2000, quantity: 49 }, + { name: '당근', price: 2000, quantity: 50 }, + { name: '참외', price: 5000, quantity: 10 }, + { name: '수박', price: 5000, quantity: 20 } +] diff --git a/Challenge/byu0324/sortByPriceAndQuantity/solve.js b/Challenge/byu0324/sortByPriceAndQuantity/solve.js new file mode 100644 index 00000000..a19f49b1 --- /dev/null +++ b/Challenge/byu0324/sortByPriceAndQuantity/solve.js @@ -0,0 +1,14 @@ +// write your codes +function solution(inputArray) { + inputArray.sort((a, b) => { + if(a.price === b.price) { + return a.quantity - b.quantity; + } else { + return a.price - b.price; + } + }); + + return inputArray; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/sortByPriceAndQuantity/solve.test.js b/Challenge/byu0324/sortByPriceAndQuantity/solve.test.js new file mode 100644 index 00000000..424f42b7 --- /dev/null +++ b/Challenge/byu0324/sortByPriceAndQuantity/solve.test.js @@ -0,0 +1,44 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [ + { + name: '사과', + price: 1000, + quantity: 2, + }, + { + name: '수박', + price: 5000, + quantity: 20, + }, + { + name: '당근', + price: 2000, + quantity: 50, + }, + { + name: '참외', + price: 5000, + quantity: 10, + }, + { + name: '오이', + price: 2000, + quantity: 49, + }, + ], + answer: [ + { name: '사과', price: 1000, quantity: 2 }, + { name: '오이', price: 2000, quantity: 49 }, + { name: '당근', price: 2000, quantity: 50 }, + { name: '참외', price: 5000, quantity: 10 }, + { name: '수박', price: 5000, quantity: 20 }, + ], +}; + +describe('sortByPriceAndQuantity', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/Challenge/byu0324/spreadOperatorMaxValue/README.md b/Challenge/byu0324/spreadOperatorMaxValue/README.md new file mode 100644 index 00000000..164b68a1 --- /dev/null +++ b/Challenge/byu0324/spreadOperatorMaxValue/README.md @@ -0,0 +1,3 @@ +## 설명 + +Spread Operator를 이용해서 값의 최대, 최소값을 구하세요 diff --git a/Challenge/byu0324/spreadOperatorMaxValue/solve.js b/Challenge/byu0324/spreadOperatorMaxValue/solve.js new file mode 100644 index 00000000..294d7ded --- /dev/null +++ b/Challenge/byu0324/spreadOperatorMaxValue/solve.js @@ -0,0 +1,8 @@ +// write your codes +function solution(inputArray) { + let max = Math.max(...inputArray); + let min = Math.min(...inputArray); + return `max : ${max}, min : ${min}`; +} + +exports.solution = solution; diff --git a/Challenge/byu0324/spreadOperatorMaxValue/solve.test.js b/Challenge/byu0324/spreadOperatorMaxValue/solve.test.js new file mode 100644 index 00000000..26f2abf9 --- /dev/null +++ b/Challenge/byu0324/spreadOperatorMaxValue/solve.test.js @@ -0,0 +1,12 @@ +const { solution } = require('./solve'); + +const test1 = { + input: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], + answer: 'max : 10, min : 1', +}; + +describe('spreadOperatorMaxValue', () => { + test('test1', () => { + expect(solution(test1.input)).toEqual(test1.answer); + }); +}); diff --git a/coverage/clover.xml b/coverage/clover.xml new file mode 100644 index 00000000..0a0ee45d --- /dev/null +++ b/coverage/clover.xml @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/coverage/coverage-final.json b/coverage/coverage-final.json new file mode 100644 index 00000000..a0853eef --- /dev/null +++ b/coverage/coverage-final.json @@ -0,0 +1,2 @@ +{"C:\\Users\\byu03\\OneDrive\\바탕 화면\\JS-Array-Challenge\\Challenge\\byu0324\\recommendAd\\solve.js": {"path":"C:\\Users\\byu03\\OneDrive\\바탕 화면\\JS-Array-Challenge\\Challenge\\byu0324\\recommendAd\\solve.js","statementMap":{"0":{"start":{"line":1,"column":20},"end":{"line":9,"column":1}},"1":{"start":{"line":14,"column":0},"end":{"line":14,"column":28}}},"fnMap":{"0":{"name":"solution","decl":{"start":{"line":12,"column":9},"end":{"line":12,"column":17}},"loc":{"start":{"line":12,"column":30},"end":{"line":12,"column":32}},"line":12}},"branchMap":{},"s":{"0":1,"1":1},"f":{"0":1},"b":{},"_coverageSchema":"1a1c01bbd47fc00a2c39e90264f33305004495a9","hash":"5482baf429a90371a63e3f7e626ffdf0230b7aac"} +} diff --git a/coverage/lcov-report/base.css b/coverage/lcov-report/base.css new file mode 100644 index 00000000..f418035b --- /dev/null +++ b/coverage/lcov-report/base.css @@ -0,0 +1,224 @@ +body, html { + margin:0; padding: 0; + height: 100%; +} +body { + font-family: Helvetica Neue, Helvetica, Arial; + font-size: 14px; + color:#333; +} +.small { font-size: 12px; } +*, *:after, *:before { + -webkit-box-sizing:border-box; + -moz-box-sizing:border-box; + box-sizing:border-box; + } +h1 { font-size: 20px; margin: 0;} +h2 { font-size: 14px; } +pre { + font: 12px/1.4 Consolas, "Liberation Mono", Menlo, Courier, monospace; + margin: 0; + padding: 0; + -moz-tab-size: 2; + -o-tab-size: 2; + tab-size: 2; +} +a { color:#0074D9; text-decoration:none; } +a:hover { text-decoration:underline; } +.strong { font-weight: bold; } +.space-top1 { padding: 10px 0 0 0; } +.pad2y { padding: 20px 0; } +.pad1y { padding: 10px 0; } +.pad2x { padding: 0 20px; } +.pad2 { padding: 20px; } +.pad1 { padding: 10px; } +.space-left2 { padding-left:55px; } +.space-right2 { padding-right:20px; } +.center { text-align:center; } +.clearfix { display:block; } +.clearfix:after { + content:''; + display:block; + height:0; + clear:both; + visibility:hidden; + } +.fl { float: left; } +@media only screen and (max-width:640px) { + .col3 { width:100%; max-width:100%; } + .hide-mobile { display:none!important; } +} + +.quiet { + color: #7f7f7f; + color: rgba(0,0,0,0.5); +} +.quiet a { opacity: 0.7; } + +.fraction { + font-family: Consolas, 'Liberation Mono', Menlo, Courier, monospace; + font-size: 10px; + color: #555; + background: #E8E8E8; + padding: 4px 5px; + border-radius: 3px; + vertical-align: middle; +} + +div.path a:link, div.path a:visited { color: #333; } +table.coverage { + border-collapse: collapse; + margin: 10px 0 0 0; + padding: 0; +} + +table.coverage td { + margin: 0; + padding: 0; + vertical-align: top; +} +table.coverage td.line-count { + text-align: right; + padding: 0 5px 0 20px; +} +table.coverage td.line-coverage { + text-align: right; + padding-right: 10px; + min-width:20px; +} + +table.coverage td span.cline-any { + display: inline-block; + padding: 0 5px; + width: 100%; +} +.missing-if-branch { + display: inline-block; + margin-right: 5px; + border-radius: 3px; + position: relative; + padding: 0 4px; + background: #333; + color: yellow; +} + +.skip-if-branch { + display: none; + margin-right: 10px; + position: relative; + padding: 0 4px; + background: #ccc; + color: white; +} +.missing-if-branch .typ, .skip-if-branch .typ { + color: inherit !important; +} +.coverage-summary { + border-collapse: collapse; + width: 100%; +} +.coverage-summary tr { border-bottom: 1px solid #bbb; } +.keyline-all { border: 1px solid #ddd; } +.coverage-summary td, .coverage-summary th { padding: 10px; } +.coverage-summary tbody { border: 1px solid #bbb; } +.coverage-summary td { border-right: 1px solid #bbb; } +.coverage-summary td:last-child { border-right: none; } +.coverage-summary th { + text-align: left; + font-weight: normal; + white-space: nowrap; +} +.coverage-summary th.file { border-right: none !important; } +.coverage-summary th.pct { } +.coverage-summary th.pic, +.coverage-summary th.abs, +.coverage-summary td.pct, +.coverage-summary td.abs { text-align: right; } +.coverage-summary td.file { white-space: nowrap; } +.coverage-summary td.pic { min-width: 120px !important; } +.coverage-summary tfoot td { } + +.coverage-summary .sorter { + height: 10px; + width: 7px; + display: inline-block; + margin-left: 0.5em; + background: url(sort-arrow-sprite.png) no-repeat scroll 0 0 transparent; +} +.coverage-summary .sorted .sorter { + background-position: 0 -20px; +} +.coverage-summary .sorted-desc .sorter { + background-position: 0 -10px; +} +.status-line { height: 10px; } +/* yellow */ +.cbranch-no { background: yellow !important; color: #111; } +/* dark red */ +.red.solid, .status-line.low, .low .cover-fill { background:#C21F39 } +.low .chart { border:1px solid #C21F39 } +.highlighted, +.highlighted .cstat-no, .highlighted .fstat-no, .highlighted .cbranch-no{ + background: #C21F39 !important; +} +/* medium red */ +.cstat-no, .fstat-no, .cbranch-no, .cbranch-no { background:#F6C6CE } +/* light red */ +.low, .cline-no { background:#FCE1E5 } +/* light green */ +.high, .cline-yes { background:rgb(230,245,208) } +/* medium green */ +.cstat-yes { background:rgb(161,215,106) } +/* dark green */ +.status-line.high, .high .cover-fill { background:rgb(77,146,33) } +.high .chart { border:1px solid rgb(77,146,33) } +/* dark yellow (gold) */ +.status-line.medium, .medium .cover-fill { background: #f9cd0b; } +.medium .chart { border:1px solid #f9cd0b; } +/* light yellow */ +.medium { background: #fff4c2; } + +.cstat-skip { background: #ddd; color: #111; } +.fstat-skip { background: #ddd; color: #111 !important; } +.cbranch-skip { background: #ddd !important; color: #111; } + +span.cline-neutral { background: #eaeaea; } + +.coverage-summary td.empty { + opacity: .5; + padding-top: 4px; + padding-bottom: 4px; + line-height: 1; + color: #888; +} + +.cover-fill, .cover-empty { + display:inline-block; + height: 12px; +} +.chart { + line-height: 0; +} +.cover-empty { + background: white; +} +.cover-full { + border-right: none !important; +} +pre.prettyprint { + border: none !important; + padding: 0 !important; + margin: 0 !important; +} +.com { color: #999 !important; } +.ignore-none { color: #999; font-weight: normal; } + +.wrapper { + min-height: 100%; + height: auto !important; + height: 100%; + margin: 0 auto -48px; +} +.footer, .push { + height: 48px; +} diff --git a/coverage/lcov-report/block-navigation.js b/coverage/lcov-report/block-navigation.js new file mode 100644 index 00000000..cc121302 --- /dev/null +++ b/coverage/lcov-report/block-navigation.js @@ -0,0 +1,87 @@ +/* eslint-disable */ +var jumpToCode = (function init() { + // Classes of code we would like to highlight in the file view + var missingCoverageClasses = ['.cbranch-no', '.cstat-no', '.fstat-no']; + + // Elements to highlight in the file listing view + var fileListingElements = ['td.pct.low']; + + // We don't want to select elements that are direct descendants of another match + var notSelector = ':not(' + missingCoverageClasses.join('):not(') + ') > '; // becomes `:not(a):not(b) > ` + + // Selecter that finds elements on the page to which we can jump + var selector = + fileListingElements.join(', ') + + ', ' + + notSelector + + missingCoverageClasses.join(', ' + notSelector); // becomes `:not(a):not(b) > a, :not(a):not(b) > b` + + // The NodeList of matching elements + var missingCoverageElements = document.querySelectorAll(selector); + + var currentIndex; + + function toggleClass(index) { + missingCoverageElements + .item(currentIndex) + .classList.remove('highlighted'); + missingCoverageElements.item(index).classList.add('highlighted'); + } + + function makeCurrent(index) { + toggleClass(index); + currentIndex = index; + missingCoverageElements.item(index).scrollIntoView({ + behavior: 'smooth', + block: 'center', + inline: 'center' + }); + } + + function goToPrevious() { + var nextIndex = 0; + if (typeof currentIndex !== 'number' || currentIndex === 0) { + nextIndex = missingCoverageElements.length - 1; + } else if (missingCoverageElements.length > 1) { + nextIndex = currentIndex - 1; + } + + makeCurrent(nextIndex); + } + + function goToNext() { + var nextIndex = 0; + + if ( + typeof currentIndex === 'number' && + currentIndex < missingCoverageElements.length - 1 + ) { + nextIndex = currentIndex + 1; + } + + makeCurrent(nextIndex); + } + + return function jump(event) { + if ( + document.getElementById('fileSearch') === document.activeElement && + document.activeElement != null + ) { + // if we're currently focused on the search input, we don't want to navigate + return; + } + + switch (event.which) { + case 78: // n + case 74: // j + goToNext(); + break; + case 66: // b + case 75: // k + case 80: // p + goToPrevious(); + break; + } + }; +})(); +window.addEventListener('keydown', jumpToCode); diff --git a/coverage/lcov-report/favicon.png b/coverage/lcov-report/favicon.png new file mode 100644 index 00000000..66918178 Binary files /dev/null and b/coverage/lcov-report/favicon.png differ diff --git a/coverage/lcov-report/index.html b/coverage/lcov-report/index.html new file mode 100644 index 00000000..152016a1 --- /dev/null +++ b/coverage/lcov-report/index.html @@ -0,0 +1,116 @@ + + + + + + Code coverage report for All files + + + + + + + + + +
+
+

All files

+
+ +
+ 100% + Statements + 2/2 +
+ + +
+ 100% + Branches + 0/0 +
+ + +
+ 100% + Functions + 1/1 +
+ + +
+ 100% + Lines + 2/2 +
+ + +
+

+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +

+ +
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
FileStatementsBranchesFunctionsLines
solve.js +
+ 		100%2/2100%0/0100%1/1100%2/2
+
+
+
+
+ Code coverage generated by + istanbul + at Sat Apr 22 2023 15:59:38 GMT+0900 (대한민국 표준시) +
+ + + + + + + \ No newline at end of file diff --git a/coverage/lcov-report/prettify.css b/coverage/lcov-report/prettify.css new file mode 100644 index 00000000..b317a7cd --- /dev/null +++ b/coverage/lcov-report/prettify.css @@ -0,0 +1 @@ +.pln{color:#000}@media screen{.str{color:#080}.kwd{color:#008}.com{color:#800}.typ{color:#606}.lit{color:#066}.pun,.opn,.clo{color:#660}.tag{color:#008}.atn{color:#606}.atv{color:#080}.dec,.var{color:#606}.fun{color:red}}@media print,projection{.str{color:#060}.kwd{color:#006;font-weight:bold}.com{color:#600;font-style:italic}.typ{color:#404;font-weight:bold}.lit{color:#044}.pun,.opn,.clo{color:#440}.tag{color:#006;font-weight:bold}.atn{color:#404}.atv{color:#060}}pre.prettyprint{padding:2px;border:1px solid #888}ol.linenums{margin-top:0;margin-bottom:0}li.L0,li.L1,li.L2,li.L3,li.L5,li.L6,li.L7,li.L8{list-style-type:none}li.L1,li.L3,li.L5,li.L7,li.L9{background:#eee} diff --git a/coverage/lcov-report/prettify.js b/coverage/lcov-report/prettify.js new file mode 100644 index 00000000..b3225238 --- /dev/null +++ b/coverage/lcov-report/prettify.js @@ -0,0 +1,2 @@ +/* eslint-disable */ +window.PR_SHOULD_USE_CONTINUATION=true;(function(){var h=["break,continue,do,else,for,if,return,while"];var u=[h,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"];var p=[u,"catch,class,delete,false,import,new,operator,private,protected,public,this,throw,true,try,typeof"];var l=[p,"alignof,align_union,asm,axiom,bool,concept,concept_map,const_cast,constexpr,decltype,dynamic_cast,explicit,export,friend,inline,late_check,mutable,namespace,nullptr,reinterpret_cast,static_assert,static_cast,template,typeid,typename,using,virtual,where"];var x=[p,"abstract,boolean,byte,extends,final,finally,implements,import,instanceof,null,native,package,strictfp,super,synchronized,throws,transient"];var R=[x,"as,base,by,checked,decimal,delegate,descending,dynamic,event,fixed,foreach,from,group,implicit,in,interface,internal,into,is,lock,object,out,override,orderby,params,partial,readonly,ref,sbyte,sealed,stackalloc,string,select,uint,ulong,unchecked,unsafe,ushort,var"];var r="all,and,by,catch,class,else,extends,false,finally,for,if,in,is,isnt,loop,new,no,not,null,of,off,on,or,return,super,then,true,try,unless,until,when,while,yes";var w=[p,"debugger,eval,export,function,get,null,set,undefined,var,with,Infinity,NaN"];var s="caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END";var I=[h,"and,as,assert,class,def,del,elif,except,exec,finally,from,global,import,in,is,lambda,nonlocal,not,or,pass,print,raise,try,with,yield,False,True,None"];var f=[h,"alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END"];var H=[h,"case,done,elif,esac,eval,fi,function,in,local,set,then,until"];var A=[l,R,w,s+I,f,H];var e=/^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/;var C="str";var z="kwd";var j="com";var O="typ";var G="lit";var L="pun";var F="pln";var m="tag";var E="dec";var J="src";var P="atn";var n="atv";var N="nocode";var M="(?:^^\\.?|[+-]|\\!|\\!=|\\!==|\\#|\\%|\\%=|&|&&|&&=|&=|\\(|\\*|\\*=|\\+=|\\,|\\-=|\\->|\\/|\\/=|:|::|\\;|<|<<|<<=|<=|=|==|===|>|>=|>>|>>=|>>>|>>>=|\\?|\\@|\\[|\\^|\\^=|\\^\\^|\\^\\^=|\\{|\\||\\|=|\\|\\||\\|\\|=|\\~|break|case|continue|delete|do|else|finally|instanceof|return|throw|try|typeof)\\s*";function k(Z){var ad=0;var S=false;var ac=false;for(var V=0,U=Z.length;V122)){if(!(al<65||ag>90)){af.push([Math.max(65,ag)|32,Math.min(al,90)|32])}if(!(al<97||ag>122)){af.push([Math.max(97,ag)&~32,Math.min(al,122)&~32])}}}}af.sort(function(av,au){return(av[0]-au[0])||(au[1]-av[1])});var ai=[];var ap=[NaN,NaN];for(var ar=0;arat[0]){if(at[1]+1>at[0]){an.push("-")}an.push(T(at[1]))}}an.push("]");return an.join("")}function W(al){var aj=al.source.match(new RegExp("(?:\\[(?:[^\\x5C\\x5D]|\\\\[\\s\\S])*\\]|\\\\u[A-Fa-f0-9]{4}|\\\\x[A-Fa-f0-9]{2}|\\\\[0-9]+|\\\\[^ux0-9]|\\(\\?[:!=]|[\\(\\)\\^]|[^\\x5B\\x5C\\(\\)\\^]+)","g"));var ah=aj.length;var an=[];for(var ak=0,am=0;ak=2&&ai==="["){aj[ak]=X(ag)}else{if(ai!=="\\"){aj[ak]=ag.replace(/[a-zA-Z]/g,function(ao){var ap=ao.charCodeAt(0);return"["+String.fromCharCode(ap&~32,ap|32)+"]"})}}}}return aj.join("")}var aa=[];for(var V=0,U=Z.length;V=0;){S[ac.charAt(ae)]=Y}}var af=Y[1];var aa=""+af;if(!ag.hasOwnProperty(aa)){ah.push(af);ag[aa]=null}}ah.push(/[\0-\uffff]/);V=k(ah)})();var X=T.length;var W=function(ah){var Z=ah.sourceCode,Y=ah.basePos;var ad=[Y,F];var af=0;var an=Z.match(V)||[];var aj={};for(var ae=0,aq=an.length;ae=5&&"lang-"===ap.substring(0,5);if(am&&!(ai&&typeof ai[1]==="string")){am=false;ap=J}if(!am){aj[ag]=ap}}var ab=af;af+=ag.length;if(!am){ad.push(Y+ab,ap)}else{var al=ai[1];var ak=ag.indexOf(al);var ac=ak+al.length;if(ai[2]){ac=ag.length-ai[2].length;ak=ac-al.length}var ar=ap.substring(5);B(Y+ab,ag.substring(0,ak),W,ad);B(Y+ab+ak,al,q(ar,al),ad);B(Y+ab+ac,ag.substring(ac),W,ad)}}ah.decorations=ad};return W}function i(T){var W=[],S=[];if(T.tripleQuotedStrings){W.push([C,/^(?:\'\'\'(?:[^\'\\]|\\[\s\S]|\'{1,2}(?=[^\']))*(?:\'\'\'|$)|\"\"\"(?:[^\"\\]|\\[\s\S]|\"{1,2}(?=[^\"]))*(?:\"\"\"|$)|\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$))/,null,"'\""])}else{if(T.multiLineStrings){W.push([C,/^(?:\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$)|\`(?:[^\\\`]|\\[\s\S])*(?:\`|$))/,null,"'\"`"])}else{W.push([C,/^(?:\'(?:[^\\\'\r\n]|\\.)*(?:\'|$)|\"(?:[^\\\"\r\n]|\\.)*(?:\"|$))/,null,"\"'"])}}if(T.verbatimStrings){S.push([C,/^@\"(?:[^\"]|\"\")*(?:\"|$)/,null])}var Y=T.hashComments;if(Y){if(T.cStyleComments){if(Y>1){W.push([j,/^#(?:##(?:[^#]|#(?!##))*(?:###|$)|.*)/,null,"#"])}else{W.push([j,/^#(?:(?:define|elif|else|endif|error|ifdef|include|ifndef|line|pragma|undef|warning)\b|[^\r\n]*)/,null,"#"])}S.push([C,/^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+\.h|[a-z]\w*)>/,null])}else{W.push([j,/^#[^\r\n]*/,null,"#"])}}if(T.cStyleComments){S.push([j,/^\/\/[^\r\n]*/,null]);S.push([j,/^\/\*[\s\S]*?(?:\*\/|$)/,null])}if(T.regexLiterals){var X=("/(?=[^/*])(?:[^/\\x5B\\x5C]|\\x5C[\\s\\S]|\\x5B(?:[^\\x5C\\x5D]|\\x5C[\\s\\S])*(?:\\x5D|$))+/");S.push(["lang-regex",new RegExp("^"+M+"("+X+")")])}var V=T.types;if(V){S.push([O,V])}var U=(""+T.keywords).replace(/^ | $/g,"");if(U.length){S.push([z,new RegExp("^(?:"+U.replace(/[\s,]+/g,"|")+")\\b"),null])}W.push([F,/^\s+/,null," \r\n\t\xA0"]);S.push([G,/^@[a-z_$][a-z_$@0-9]*/i,null],[O,/^(?:[@_]?[A-Z]+[a-z][A-Za-z_$@0-9]*|\w+_t\b)/,null],[F,/^[a-z_$][a-z_$@0-9]*/i,null],[G,new RegExp("^(?:0x[a-f0-9]+|(?:\\d(?:_\\d+)*\\d*(?:\\.\\d*)?|\\.\\d\\+)(?:e[+\\-]?\\d+)?)[a-z]*","i"),null,"0123456789"],[F,/^\\[\s\S]?/,null],[L,/^.[^\s\w\.$@\'\"\`\/\#\\]*/,null]);return g(W,S)}var K=i({keywords:A,hashComments:true,cStyleComments:true,multiLineStrings:true,regexLiterals:true});function Q(V,ag){var U=/(?:^|\s)nocode(?:\s|$)/;var ab=/\r\n?|\n/;var ac=V.ownerDocument;var S;if(V.currentStyle){S=V.currentStyle.whiteSpace}else{if(window.getComputedStyle){S=ac.defaultView.getComputedStyle(V,null).getPropertyValue("white-space")}}var Z=S&&"pre"===S.substring(0,3);var af=ac.createElement("LI");while(V.firstChild){af.appendChild(V.firstChild)}var W=[af];function ae(al){switch(al.nodeType){case 1:if(U.test(al.className)){break}if("BR"===al.nodeName){ad(al);if(al.parentNode){al.parentNode.removeChild(al)}}else{for(var an=al.firstChild;an;an=an.nextSibling){ae(an)}}break;case 3:case 4:if(Z){var am=al.nodeValue;var aj=am.match(ab);if(aj){var ai=am.substring(0,aj.index);al.nodeValue=ai;var ah=am.substring(aj.index+aj[0].length);if(ah){var ak=al.parentNode;ak.insertBefore(ac.createTextNode(ah),al.nextSibling)}ad(al);if(!ai){al.parentNode.removeChild(al)}}}break}}function ad(ak){while(!ak.nextSibling){ak=ak.parentNode;if(!ak){return}}function ai(al,ar){var aq=ar?al.cloneNode(false):al;var ao=al.parentNode;if(ao){var ap=ai(ao,1);var an=al.nextSibling;ap.appendChild(aq);for(var am=an;am;am=an){an=am.nextSibling;ap.appendChild(am)}}return aq}var ah=ai(ak.nextSibling,0);for(var aj;(aj=ah.parentNode)&&aj.nodeType===1;){ah=aj}W.push(ah)}for(var Y=0;Y=S){ah+=2}if(V>=ap){Z+=2}}}var t={};function c(U,V){for(var S=V.length;--S>=0;){var T=V[S];if(!t.hasOwnProperty(T)){t[T]=U}else{if(window.console){console.warn("cannot override language handler %s",T)}}}}function q(T,S){if(!(T&&t.hasOwnProperty(T))){T=/^\s*]*(?:>|$)/],[j,/^<\!--[\s\S]*?(?:-\->|$)/],["lang-",/^<\?([\s\S]+?)(?:\?>|$)/],["lang-",/^<%([\s\S]+?)(?:%>|$)/],[L,/^(?:<[%?]|[%?]>)/],["lang-",/^]*>([\s\S]+?)<\/xmp\b[^>]*>/i],["lang-js",/^]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-css",/^]*>([\s\S]*?)(<\/style\b[^>]*>)/i],["lang-in.tag",/^(<\/?[a-z][^<>]*>)/i]]),["default-markup","htm","html","mxml","xhtml","xml","xsl"]);c(g([[F,/^[\s]+/,null," \t\r\n"],[n,/^(?:\"[^\"]*\"?|\'[^\']*\'?)/,null,"\"'"]],[[m,/^^<\/?[a-z](?:[\w.:-]*\w)?|\/?>$/i],[P,/^(?!style[\s=]|on)[a-z](?:[\w:-]*\w)?/i],["lang-uq.val",/^=\s*([^>\'\"\s]*(?:[^>\'\"\s\/]|\/(?=\s)))/],[L,/^[=<>\/]+/],["lang-js",/^on\w+\s*=\s*\"([^\"]+)\"/i],["lang-js",/^on\w+\s*=\s*\'([^\']+)\'/i],["lang-js",/^on\w+\s*=\s*([^\"\'>\s]+)/i],["lang-css",/^style\s*=\s*\"([^\"]+)\"/i],["lang-css",/^style\s*=\s*\'([^\']+)\'/i],["lang-css",/^style\s*=\s*([^\"\'>\s]+)/i]]),["in.tag"]);c(g([],[[n,/^[\s\S]+/]]),["uq.val"]);c(i({keywords:l,hashComments:true,cStyleComments:true,types:e}),["c","cc","cpp","cxx","cyc","m"]);c(i({keywords:"null,true,false"}),["json"]);c(i({keywords:R,hashComments:true,cStyleComments:true,verbatimStrings:true,types:e}),["cs"]);c(i({keywords:x,cStyleComments:true}),["java"]);c(i({keywords:H,hashComments:true,multiLineStrings:true}),["bsh","csh","sh"]);c(i({keywords:I,hashComments:true,multiLineStrings:true,tripleQuotedStrings:true}),["cv","py"]);c(i({keywords:s,hashComments:true,multiLineStrings:true,regexLiterals:true}),["perl","pl","pm"]);c(i({keywords:f,hashComments:true,multiLineStrings:true,regexLiterals:true}),["rb"]);c(i({keywords:w,cStyleComments:true,regexLiterals:true}),["js"]);c(i({keywords:r,hashComments:3,cStyleComments:true,multilineStrings:true,tripleQuotedStrings:true,regexLiterals:true}),["coffee"]);c(g([],[[C,/^[\s\S]+/]]),["regex"]);function d(V){var U=V.langExtension;try{var S=a(V.sourceNode);var T=S.sourceCode;V.sourceCode=T;V.spans=S.spans;V.basePos=0;q(U,T)(V);D(V)}catch(W){if("console" in window){console.log(W&&W.stack?W.stack:W)}}}function y(W,V,U){var S=document.createElement("PRE");S.innerHTML=W;if(U){Q(S,U)}var T={langExtension:V,numberLines:U,sourceNode:S};d(T);return S.innerHTML}function b(ad){function Y(af){return document.getElementsByTagName(af)}var ac=[Y("pre"),Y("code"),Y("xmp")];var T=[];for(var aa=0;aa=0){var ah=ai.match(ab);var am;if(!ah&&(am=o(aj))&&"CODE"===am.tagName){ah=am.className.match(ab)}if(ah){ah=ah[1]}var al=false;for(var ak=aj.parentNode;ak;ak=ak.parentNode){if((ak.tagName==="pre"||ak.tagName==="code"||ak.tagName==="xmp")&&ak.className&&ak.className.indexOf("prettyprint")>=0){al=true;break}}if(!al){var af=aj.className.match(/\blinenums\b(?::(\d+))?/);af=af?af[1]&&af[1].length?+af[1]:true:false;if(af){Q(aj,af)}S={langExtension:ah,sourceNode:aj,numberLines:af};d(S)}}}if(X]*(?:>|$)/],[PR.PR_COMMENT,/^<\!--[\s\S]*?(?:-\->|$)/],[PR.PR_PUNCTUATION,/^(?:<[%?]|[%?]>)/],["lang-",/^<\?([\s\S]+?)(?:\?>|$)/],["lang-",/^<%([\s\S]+?)(?:%>|$)/],["lang-",/^]*>([\s\S]+?)<\/xmp\b[^>]*>/i],["lang-handlebars",/^]*type\s*=\s*['"]?text\/x-handlebars-template['"]?\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-js",/^]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-css",/^]*>([\s\S]*?)(<\/style\b[^>]*>)/i],["lang-in.tag",/^(<\/?[a-z][^<>]*>)/i],[PR.PR_DECLARATION,/^{{[#^>/]?\s*[\w.][^}]*}}/],[PR.PR_DECLARATION,/^{{&?\s*[\w.][^}]*}}/],[PR.PR_DECLARATION,/^{{{>?\s*[\w.][^}]*}}}/],[PR.PR_COMMENT,/^{{![^}]*}}/]]),["handlebars","hbs"]);PR.registerLangHandler(PR.createSimpleLexer([[PR.PR_PLAIN,/^[ \t\r\n\f]+/,null," \t\r\n\f"]],[[PR.PR_STRING,/^\"(?:[^\n\r\f\\\"]|\\(?:\r\n?|\n|\f)|\\[\s\S])*\"/,null],[PR.PR_STRING,/^\'(?:[^\n\r\f\\\']|\\(?:\r\n?|\n|\f)|\\[\s\S])*\'/,null],["lang-css-str",/^url\(([^\)\"\']*)\)/i],[PR.PR_KEYWORD,/^(?:url|rgb|\!important|@import|@page|@media|@charset|inherit)(?=[^\-\w]|$)/i,null],["lang-css-kw",/^(-?(?:[_a-z]|(?:\\[0-9a-f]+ ?))(?:[_a-z0-9\-]|\\(?:\\[0-9a-f]+ ?))*)\s*:/i],[PR.PR_COMMENT,/^\/\*[^*]*\*+(?:[^\/*][^*]*\*+)*\//],[PR.PR_COMMENT,/^(?:)/],[PR.PR_LITERAL,/^(?:\d+|\d*\.\d+)(?:%|[a-z]+)?/i],[PR.PR_LITERAL,/^#(?:[0-9a-f]{3}){1,2}/i],[PR.PR_PLAIN,/^-?(?:[_a-z]|(?:\\[\da-f]+ ?))(?:[_a-z\d\-]|\\(?:\\[\da-f]+ ?))*/i],[PR.PR_PUNCTUATION,/^[^\s\w\'\"]+/]]),["css"]);PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_KEYWORD,/^-?(?:[_a-z]|(?:\\[\da-f]+ ?))(?:[_a-z\d\-]|\\(?:\\[\da-f]+ ?))*/i]]),["css-kw"]);PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_STRING,/^[^\)\"\']+/]]),["css-str"]); diff --git a/coverage/lcov-report/solve.js.html b/coverage/lcov-report/solve.js.html new file mode 100644 index 00000000..f695d6de --- /dev/null +++ b/coverage/lcov-report/solve.js.html @@ -0,0 +1,127 @@ + + + + + + Code coverage report for solve.js + + + + + + + + + +
+
+

All files solve.js

+
+ +
+ 100% + Statements + 2/2 +
+ + +
+ 100% + Branches + 0/0 +
+ + +
+ 100% + Functions + 1/1 +
+ + +
+ 100% + Lines + 2/2 +
+ + +
+

+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +

+ +
+
+ 

+
1
+2
+3
+4
+5
+6
+7
+8
+9
+10
+11
+12
+13
+14
+151x
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+1x
+ 
const userHistory = [
+  { date: '2020-11-03', watched: ['KT', 'BBQ'] },
+  { date: '2020-11-04', watched: ['정관장', 'KT', '딱좋은데이'] },
+  { date: '2020-11-05', watched: ['그랑사가', '농심'] },
+  { date: '2020-11-06', watched: ['BBQ'] },
+  { date: '2020-11-07', watched: ['쌍용자동차', 'BBQ', 'KT'] },
+  { date: '2020-11-08', watched: ['켈로그코리아', '빙그레'] },
+  { date: '2020-11-09', watched: ['KT', '그랑사가', '빙그레'] },
+];
+ 
+// write your codes
+function solution(inputArray) {}
+ 
+exports.solution = solution;
+ 
+ +
+
+
+ Code coverage generated by + istanbul + at Sat Apr 22 2023 15:59:38 GMT+0900 (대한민국 표준시) +
+ + + + + + + \ No newline at end of file diff --git a/coverage/lcov-report/sort-arrow-sprite.png b/coverage/lcov-report/sort-arrow-sprite.png new file mode 100644 index 00000000..03f704a6 Binary files /dev/null and b/coverage/lcov-report/sort-arrow-sprite.png differ diff --git a/coverage/lcov-report/sorter.js b/coverage/lcov-report/sorter.js new file mode 100644 index 00000000..2bb296a8 --- /dev/null +++ b/coverage/lcov-report/sorter.js @@ -0,0 +1,196 @@ +/* eslint-disable */ +var addSorting = (function() { + 'use strict'; + var cols, + currentSort = { + index: 0, + desc: false + }; + + // returns the summary table element + function getTable() { + return document.querySelector('.coverage-summary'); + } + // returns the thead element of the summary table + function getTableHeader() { + return getTable().querySelector('thead tr'); + } + // returns the tbody element of the summary table + function getTableBody() { + return getTable().querySelector('tbody'); + } + // returns the th element for nth column + function getNthColumn(n) { + return getTableHeader().querySelectorAll('th')[n]; + } + + function onFilterInput() { + const searchValue = document.getElementById('fileSearch').value; + const rows = document.getElementsByTagName('tbody')[0].children; + for (let i = 0; i < rows.length; i++) { + const row = rows[i]; + if ( + row.textContent + .toLowerCase() + .includes(searchValue.toLowerCase()) + ) { + row.style.display = ''; + } else { + row.style.display = 'none'; + } + } + } + + // loads the search box + function addSearchBox() { + var template = document.getElementById('filterTemplate'); + var templateClone = template.content.cloneNode(true); + templateClone.getElementById('fileSearch').oninput = onFilterInput; + template.parentElement.appendChild(templateClone); + } + + // loads all columns + function loadColumns() { + var colNodes = getTableHeader().querySelectorAll('th'), + colNode, + cols = [], + col, + i; + + for (i = 0; i < colNodes.length; i += 1) { + colNode = colNodes[i]; + col = { + key: colNode.getAttribute('data-col'), + sortable: !colNode.getAttribute('data-nosort'), + type: colNode.getAttribute('data-type') || 'string' + }; + cols.push(col); + if (col.sortable) { + col.defaultDescSort = col.type === 'number'; + colNode.innerHTML = + colNode.innerHTML + ''; + } + } + return cols; + } + // attaches a data attribute to every tr element with an object + // of data values keyed by column name + function loadRowData(tableRow) { + var tableCols = tableRow.querySelectorAll('td'), + colNode, + col, + data = {}, + i, + val; + for (i = 0; i < tableCols.length; i += 1) { + colNode = tableCols[i]; + col = cols[i]; + val = colNode.getAttribute('data-value'); + if (col.type === 'number') { + val = Number(val); + } + data[col.key] = val; + } + return data; + } + // loads all row data + function loadData() { + var rows = getTableBody().querySelectorAll('tr'), + i; + + for (i = 0; i < rows.length; i += 1) { + rows[i].data = loadRowData(rows[i]); + } + } + // sorts the table using the data for the ith column + function sortByIndex(index, desc) { + var key = cols[index].key, + sorter = function(a, b) { + a = a.data[key]; + b = b.data[key]; + return a < b ? -1 : a > b ? 1 : 0; + }, + finalSorter = sorter, + tableBody = document.querySelector('.coverage-summary tbody'), + rowNodes = tableBody.querySelectorAll('tr'), + rows = [], + i; + + if (desc) { + finalSorter = function(a, b) { + return -1 * sorter(a, b); + }; + } + + for (i = 0; i < rowNodes.length; i += 1) { + rows.push(rowNodes[i]); + tableBody.removeChild(rowNodes[i]); + } + + rows.sort(finalSorter); + + for (i = 0; i < rows.length; i += 1) { + tableBody.appendChild(rows[i]); + } + } + // removes sort indicators for current column being sorted + function removeSortIndicators() { + var col = getNthColumn(currentSort.index), + cls = col.className; + + cls = cls.replace(/ sorted$/, '').replace(/ sorted-desc$/, ''); + col.className = cls; + } + // adds sort indicators for current column being sorted + function addSortIndicators() { + getNthColumn(currentSort.index).className += currentSort.desc + ? ' sorted-desc' + : ' sorted'; + } + // adds event listeners for all sorter widgets + function enableUI() { + var i, + el, + ithSorter = function ithSorter(i) { + var col = cols[i]; + + return function() { + var desc = col.defaultDescSort; + + if (currentSort.index === i) { + desc = !currentSort.desc; + } + sortByIndex(i, desc); + removeSortIndicators(); + currentSort.index = i; + currentSort.desc = desc; + addSortIndicators(); + }; + }; + for (i = 0; i < cols.length; i += 1) { + if (cols[i].sortable) { + // add the click event handler on the th so users + // dont have to click on those tiny arrows + el = getNthColumn(i).querySelector('.sorter').parentElement; + if (el.addEventListener) { + el.addEventListener('click', ithSorter(i)); + } else { + el.attachEvent('onclick', ithSorter(i)); + } + } + } + } + // adds sorting functionality to the UI + return function() { + if (!getTable()) { + return; + } + cols = loadColumns(); + loadData(); + addSearchBox(); + addSortIndicators(); + enableUI(); + }; +})(); + +window.addEventListener('load', addSorting); diff --git a/coverage/lcov.info b/coverage/lcov.info new file mode 100644 index 00000000..bea8b50c --- /dev/null +++ b/coverage/lcov.info @@ -0,0 +1,13 @@ +TN: +SF:Challenge\byu0324\recommendAd\solve.js +FN:12,solution +FNF:1 +FNH:1 +FNDA:1,solution +DA:1,1 +DA:14,1 +LF:2 +LH:2 +BRF:0 +BRH:0 +end_of_record diff --git a/package.json b/package.json index 3decd939..71416389 100644 --- a/package.json +++ b/package.json @@ -4,7 +4,7 @@ "description": "## 자바스크립트 배열을 마스터 해보자!", "main": "index.js", "scripts": { - "test": "jest ./Challenge" + "test": "jest ./Challenge/byu0324/spreadOperatorMAxValue" }, "repository": { "type": "git",