๐๋ฌธ์ ๋งํฌ
๐ํ์ด
์๊ฐ ๋ณต์ก๋๋ O(n) ์ผ๋ก ํฐ ๋ฌด๋ฆฌ ์์ด ํ ์ ์์๋ค.
// ์๊ฐ ๋ณต์ก๋ O(n)
/**
* @param {number[]} original
* @param {number} m
* @param {number} n
* @return {number[][]}
*/
var construct2DArray = function (original, m, n) {
if (m * n !== original.length) {
return [];
}
let answer = [];
for (let i = 0; i < m; ++i) {
let sliced = original.slice(i * n, (i + 1) * n);
answer.push(sliced);
}
return answer;
};
'๐Algorithm' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
LeetCode > 1346. Check If N and Its Double Exist (0) | 2025.04.03 |
---|---|
LeetCode > 806. Number of Lines To Write String (0) | 2025.04.02 |
LeetCode > 2591. Distribute Money to Maximum Children (0) | 2025.03.28 |
LeetCode [JS] > 392. Is Subsequence (0) | 2025.03.27 |
LeetCode [JS] > Third Maximum Number (0) | 2025.03.26 |