requires the number of generators to meet / ^ [Amurz] {2} d {3} $/
each generation is not repeated
for example, 1000 are generated, 1000 are not repeated
there is no need to remove duplicates such as arrays, it seems that the algorithm can directly guarantee the weight
ask for help
you can generate several in sequence, and then just take one at random
think of the number to be generated as a 36-digit (26-letter + 10-digit) five-digit number that meets the following conditions:
-the range is AA000-ZZ999
-the last three digits are numbers (excluding the last three letters in the above interval)
then number the numbers starting at 0 in order. For example, AA000 is 0, AA001 is 1, and so on, suppose there are a total of m digits. Next, find out the corresponding relationship between the number N and the number n.
the set of collections I now get through the mongoose query looks like this: [{ _id: "123456", sex: 0 },{ _id: "222222", sex: 1 },{ _id: "111111", sex: 1 },{ _id: "333333", sex: 0 ...
I want to implement a small navigation function with an array of js. I turned it into this for him. $arr = [ 1001 | computer , 1002 | personal computer , 99 | Asustek computer, 100 | Asustek Notebook]; what I m going to do now is my ...
data A: [ { "id":340, "name":"", "sub":[ { "id":341, "name":"" }, { &q...