Yunhai
2020-11-28 11:22:53
I try to add my thought into comment but the space is not enough.
Not sure about what constraints you actually have. Probably you can list out all possibility from all arrays and then make all combinations later to reduce the time complexity;
For example, convert all values from input arrays to a map like the following
{
//I highly suggest use a set here instead of a list so you don't need to
//worry about duplicate number while adding new values
1: [1, 12 ,13],
2: [2, 21],
3: [3],
4: [4],
5: [5],
}
then you can combine all values from a n arrays, which it's already answer from the past: JavaScript - Generating combinations from n arrays with m elements.
This is the best solution I can imagine theoretically since you only have the extra O(sum of all arrays size) + the combination cost, in which I don't believe there are much space you can reduce.
热门帖子
热门github
6