Have bosses know that under the condition of a given number of two groups, the number of the two groups the elements in the two combinations, and then once every combination it outputs a combination plan, note that here refers to the combination of both two elements output again, not only output a pair of elements, and then the final output all not to repeat options,

CodePudding user response:

This is the mapping algorithm, one-to-one mapping

CodePudding user response:

A simple example?

CodePudding user response:

This in essence should be cartesian product, you can query the cartesian product of the algorithm