家里的广玉兰树好像有问题,到哪里去请教是什么问题?# Living
t*e
1 楼
Given n sets of choices: (1,2,3), (2,3,4), (4,5) You pick one element from
each set of choices. Generate all possible picking.
I wonder if there is trick to this problem. It seems brute force solution
can solve it. any optimized solutions?
each set of choices. Generate all possible picking.
I wonder if there is trick to this problem. It seems brute force solution
can solve it. any optimized solutions?