得到一个含有100以内不重复的随机数元素并且有序的数组。

import java.util.HashSet;


public class RandomNumSort {

public static void main(String[] args) {

HashSet<Integer> hs = new HashSet<Integer>();
int temp, setLen;
int[] numArr = new int[10];
numArr[0] = (int) (Math.random() * 100);
hs.add(numArr[0]);

for (int i = 1; i < numArr.length; i++) {
numArr[i] = (int) (Math.random() * 100);
setLen = hs.size();
hs.add(numArr[i]);
if (hs.size() > setLen) {
for (int j = i; j > 0; j--) {
if (numArr[j] < numArr[j - 1]) {
temp = numArr[j - 1];
numArr[j - 1] = numArr[j];
numArr[j] = temp;
}
}
} else {
i--;
}
}

for (int i : numArr) {
System.out.println(i);
}
}
}