版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/weixin_38361347/article/details/82181574
//方式1
List<Integer> a = new ArrayList<Integer>();
for (int i = 0; i < 1000; i++) {
a.add(new Random().nextInt());
}
int num = 0;
Map<Integer, String> map = new HashMap<Integer, String>();
for (int i = 0; i <a.size(); i++) {
if(!map.containsKey(a.get(i))) {
//System.out.println(a.get(i));
map.put(a.get(i), null);
num++;
if(num==100) {
break;
}
}
}
for (Map.Entry<Integer, String> integer : map.entrySet()) {
System.out.println(integer.getKey());
}
//方式2
Set<Integer> set = new TreeSet<>();
int r = 0;
for (int i = 0; i < 1000; i++) {
r = (int) (Math.random()*100);
//System.out.println(r);
set.add(r);
}
set.forEach(s->{
System.out.println(s);
});