Commit d1edacf

committed

solve: 배열 조각하기

1 parent 49bc36b commit d1edacfCopy full SHA for d1edacf

File tree

+17

-0

lines changed

+17

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+// Solution 1`
	`2`	`+function solution(arr, query) {`
	`3`	`+ const arrAfterQuery = arr.slice();`
	`4`	`+`
	`5`	`+ query.forEach((num, index) => {`
	`6`	`+ const isEvenNumberIndex = index % 2 === 0;`
	`7`	`+ const startIndex = isEvenNumberIndex ? num + 1 : 0;`
	`8`	`+ const deleteCount = isEvenNumberIndex ? arrAfterQuery.length - num : num;`
	`9`	`+`
	`10`	`+ arrAfterQuery.splice(startIndex, deleteCount);`
	`11`	`+ });`
	`12`	`+`
	`13`	`+ return arrAfterQuery;`
	`14`	`+}`
	`15`	`+`
	`16`	`+solution([0, 1, 2, 3, 4, 5], [4, 1, 2]);`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -323,3 +323,4 @@`
`323`	`323`	\| 24.01.02. \| `Level 0` \| [무작위로 K개의 수 뽑기](https://school.programmers.co.kr/learn/courses/30/lessons/181858) \| [JS](https://github.com/JeongHwan-dev/Algorithm-solving-with-js/blob/master/Level0/PRO181858.js) \|
`324`	`324`	\| 24.01.06. \| `Level 0` \| [특정 문자열로 끝나는 가장 긴 부분 문자열 찾기](https://school.programmers.co.kr/learn/courses/30/lessons/181872) \| [JS](https://github.com/JeongHwan-dev/Algorithm-solving-with-js/blob/master/Level0/PRO181872.js) \|
`325`	`325`	\| 24.01.07. \| `Level 0` \| [세 개의 구분자](https://school.programmers.co.kr/learn/courses/30/lessons/181862) \| [JS](https://github.com/JeongHwan-dev/Algorithm-solving-with-js/blob/master/Level0/PRO181862.js) \|
	`326`	+\| 24.01.08. \| `Level 0` \| [배열 조각하기](https://school.programmers.co.kr/learn/courses/30/lessons/181893) \| [JS](https://github.com/JeongHwan-dev/Algorithm-solving-with-js/blob/master/Level0/PRO181893.js) \|

Comments

(0)