直接上代码
import org.springframework.util.Assert;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Random;
import java.util.Set;
public class InviteCodeUtil {
public static String generateInviteCode(int len) {
Assert.isTrue(len > 0, "长度要大于0");
char[] chars = {'Q', 'W', 'E', '8', 'S', '2', 'D', 'Z',
'X', '9', 'C', '7', 'P', '5', 'K', '3',
'M', 'J', 'U', 'F', 'R', '4', 'V', 'Y',
'T', 'N', '6', 'B', 'G', 'H', 'A', 'L'};
Random random = new Random();
char[] inviteChars = new char[len];
for (int i = 0; i < len; i++) {
inviteChars[i] = chars[random.nextInt(chars.length)];
}
return String.valueOf(inviteChars);
}
public static void main(String[] args) {
long start = System.currentTimeMillis();
Set set = new HashSet();
for (int i = 0; i < 1000000; i++) {
set.add(generateInviteCode(6));
}
Iterator iterator = set.iterator();
for (int i =0;i<10;i++){
System.out.println(iterator.next());
}
System.out.println();
System.out.println(set.size());
}
}
测试结果:
B76BS3
994UXZ
Z5H933
VTDP24
AV6BSB
GZMLHF
ZEDPSM
FWKMZY
BKD5HA
RSH6LR
999536
运行过几次,重复率不到1/1000,生产中为了确保不重复先需要查询数据库有没有重复的邀请码,没有重复则插入数据库,否则再生成一次。