let's get IT with DAVINA ๐Ÿ’ป

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค]Lv0. 2์ฐจ์›์œผ๋กœ ๋งŒ๋“ค๊ธฐ ๋ณธ๋ฌธ

DEV_IN/๋ฌธ์ œํ’€์ด

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค]Lv0. 2์ฐจ์›์œผ๋กœ ๋งŒ๋“ค๊ธฐ

๋‹ค๋นˆ์น˜์ฝ”๋“œ๐Ÿ’Ž 2023. 3. 17. 16:13

โ“ ๋ฌธ์ œ ์„ค๋ช…

์ •์ˆ˜ ๋ฐฐ์—ด num_list์™€ ์ •์ˆ˜ n์ด ๋งค๊ฐœ๋ณ€์ˆ˜๋กœ ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค. num_list๋ฅผ ๋‹ค์Œ ์„ค๋ช…๊ณผ ๊ฐ™์ด 2์ฐจ์› ๋ฐฐ์—ด๋กœ ๋ฐ”๊ฟ” returnํ•˜๋„๋ก solution ํ•จ์ˆ˜๋ฅผ ์™„์„ฑํ•ด์ฃผ์„ธ์š”.
num_list๊ฐ€ [1, 2, 3, 4, 5, 6, 7, 8] ๋กœ ๊ธธ์ด๊ฐ€ 8์ด๊ณ  n์ด 2์ด๋ฏ€๋กœ num_list๋ฅผ 2 * 4 ๋ฐฐ์—ด๋กœ ๋‹ค์Œ๊ณผ ๊ฐ™์ด ๋ณ€๊ฒฝํ•ฉ๋‹ˆ๋‹ค. 2์ฐจ์›์œผ๋กœ ๋ฐ”๊ฟ€ ๋•Œ์—๋Š” num_list์˜ ์›์†Œ๋“ค์„ ์•ž์—์„œ๋ถ€ํ„ฐ n๊ฐœ์”ฉ ๋‚˜๋ˆ  2์ฐจ์› ๋ฐฐ์—ด๋กœ ๋ณ€๊ฒฝํ•ฉ๋‹ˆ๋‹ค.
num_list n result
[1,2,3,4,5,6,7,8] 2 [[1, 2], [3, 4], [5, 6], [7, 8]]

๐Ÿšซ ์ œํ•œ์‚ฌํ•ญ

  • num_list์˜ ๊ธธ์ด๋Š” n์˜ ๋ฐฐ ์ˆ˜๊ฐœ์ž…๋‹ˆ๋‹ค.
  • 0 ≤ num_list์˜ ๊ธธ์ด ≤ 150
  • 2 ≤ n < num_list์˜ ๊ธธ์ด

โ—๏ธ๋น„๋‹ˆ's ํ’€์ด

splice ๋ฉ”์„œ๋“œ๋ฅผ ์ œ๋Œ€๋กœ ์•Œ๊ณ  ์‚ฌ์šฉํ•˜์ง€ ์•Š์€ ๋“ฏ ํ•˜์—ฌ ์ •๋ฆฌ๊ฒธ ๋ธ”๋กœ๊น…์„ ํ•ด๋ณธ๋‹ค.

function solution(num_list, n) {
	let arr=[];
    let count=num_list.length/n
    
    for(let i=0;i<count;i++){
        arr.push(num_list.splice(0,n)); //0๋ถ€ํ„ฐ n๊นŒ์ง€ ์ œ๊ฑฐํ•ด์„œ ๊ทธ ๋ฐฐ์—ด์„ return (n๊ฐœ์”ฉ ๋‚˜๋ˆ ์ฃผ๊ธฐ)
    }
    return arr;
}

⊕ Extra Knowledge ++

Array.prototype.splice()

splice() ๋ฉ”์„œ๋“œ๋Š” ๋ฐฐ์—ด์˜ ๊ธฐ์กด ์š”์†Œ๋ฅผ ์‚ญ์ œ ๋˜๋Š” ๊ต์ฒดํ•˜๊ฑฐ๋‚˜ ์ƒˆ ์š”์†Œ๋ฅผ ์ถ”๊ฐ€ํ•˜์—ฌ ๋ฐฐ์—ด์˜ ๋‚ด์šฉ์„ ๋ณ€๊ฒฝํ•ฉ๋‹ˆ๋‹ค.
๊ตฌ๋ฌธ ๐Ÿ”ฝ
array.splice(start[, deleteCount[, item1[, item2[, ...]]]])

- start: ๋ฐฐ์—ด์˜ ๋ณ€๊ฒฝ์„ ์‹œ์ž‘ํ•  ์ธ๋ฑ์Šค
- deleteCount: ๋ฐฐ์—ด์—์„œ ์ œ๊ฑฐํ•  ์š”์†Œ์˜ ๊ฐœ์ˆ˜
- item, item..: ๋ฐฐ์—ด์— ์ถ”๊ฐ€ํ•  ์š”์†Œ
- ๋ฐ˜ํ™˜๊ฐ’: ์ œ๊ฑฐํ•œ ์š”์†Œ๋ฅผ ๋‹ด์€ ๋ฐฐ์—ด!

 

Comments