一.先造出一百万条数据
//获得系统的时间,单位为毫秒
long startTime = System.currentTimeMillis();
//造出100w条数据
List<Integer> initLists = new ArrayList<>();
for (int i = 1; i <= 1000000; i++) {
initLists.add(i);
}
二.随机在100w里抽取5条
//随机在100w里抽取5条
Random random = new Random();
List<Integer> randomLists = new ArrayList<>();
for (int i = 1; i <= 5; i++) {
randomLists.add(random.nextInt(1000000));
}
System.out.println("我是随机剔除数" + randomLists);
三.100w里去除这5条
//100w里去除这5条
for (Integer rand : randomLists) {
initLists.remove(rand);
}
四. 获取被去除的5个数
//获取被去除的5个数
List<Integer> removeNumbers = findRemoveNumber1(initLists, 1000000);
System.out.println("被剔除数" + randomLists);
System.out.println("找出剔除数" + removeNumbers);
long endTime = System.currentTimeMillis(); //获取结束时间
System.out.println("程序运行时间" + (endTime - startTime) + "毫秒");
方法1:
/**
* 找出剔除数.
*
* @param numbers 现在所剩数据
* @param count 原先数据总数
* @return
*/
private static List<Integer> findRemoveNumber1(List<Integer> numbers, int count) {
List<Integer> removeList = new ArrayList<>();
// 将现有数加入BitSet
BitSet bitSet = new BitSet(count);
for (Integer number : numbers) {
bitSet.set(number);
}
// 遍历查找
for (int i = 1; i <= count; i++) {
if (!bitSet.get(i)) {
removeList.add(i);
}
}
return removeList;
}
方法2:
/**
* 找出剔除数.
*
* @param numbers 现在所剩数据
* @param count 原先数据总数
* @return
*/
private static List<Integer> findRemoveNumber2(List<Integer> numbers, int count) {
List<Integer> removeList = new ArrayList<>();
// 获取剔除的数量
int removeCount = count - numbers.size();
// 将现有数加入BitSet
BitSet bitSet = new BitSet(count);
for (Integer number : numbers) {
bitSet.set(number - 1);
}
// 定义
int lastRemoveIndex = 0;
for (int i = 1; i <= removeCount; i++) {
lastRemoveIndex = bitSet.nextClearBit(lastRemoveIndex);
removeList.add(++lastRemoveIndex);
}
return removeList;
}
多多评论一起进步, 有帮助到你就点个赞呗!!!!!!!