If more sub-arrays are requested than the number of items in the input, So you can simply do: results.push(subArrays) Only copies of it are passed to recursive calls. One notable wasted computation in the implementation is the unnecessary array copy here: results.push() In the implementation I don't see excessive computations or wasted storage to make the order of time or space complexity worse.
Here is my attempt: function getSubarrays(array, numOfSubarray) )\$. For example: const array = Ĭonst subarrays = getSubarrays(array, numOfSubarray) They have to have at least one item in it. And the subarrays have to be continuous, meaning the original order of items in the array has to be preserved. The number of subarrays is exact the integer number passed to the function. I am writing a function that takes an array and an integer number and returns an array of all the partitions into subarrays (so an array of arrays of subarrays).
0 kommentar(er)
