不重复抽奖

package com.gysgogo;


import java.util.ArrayList;
import java.util.List;


public class Random {
public static List<int[]> historys = new ArrayList<int[]>();


public Random() {

}


public int[] next(int drawNum, int drawTotalNum) {
int[] rs = new int[drawNum];
java.util.Random random = new java.util.Random();
int lt = getLessThanInHistory(drawTotalNum);
if (lt == drawTotalNum) {
System.out.println("no num to draw");
return new int[drawNum];
} else if (lt + drawNum > drawTotalNum) {
List<Integer> off = getOffList(drawTotalNum);
int o = drawTotalNum - lt;
System.out.println(o + " num to draw");
for (int i = 0; i < o; i++) {
rs[i] = off.remove(random.nextInt(off.size()));
}
} else if (lt + drawNum > drawTotalNum * 0.7) {
System.out.println("use list method to draw");
List<Integer> off = getOffList(drawTotalNum);
for (int i = 0; i < drawNum; i++) {
rs[i] = off.remove(random.nextInt(off.size()));
}
} else {
System.out.println("use common method to draw");
for (int i = 0; i < drawNum;) {
int rd = random.nextInt(drawTotalNum) + 1;
if (isInHistory(rd) || inArray(rd, rs, 0, i)) {
continue;
} else {
rs[i] = rd;
i++;
}
}
}
historys.add(rs);
return rs;
}


private boolean inArray(int value, int[] array, int b, int e) {
for (int i = b; i < e; i++) {
if (array[i] == value) {
return true;
}
}
return false;
}


public static void main(String args[]) {
Random random = new Random();
int rs1[] = random.next(8, 10);
for (int i : rs1) {
System.out.print(i + " ");
}
System.out.println();
int[] rs = random.next(5, 15);
for (int i : rs) {
System.out.print(i + " ");
}
System.out.println();
}


public boolean isInHistory(int value) {
for (int[] history : historys) {
for (int temp : history) {
if (value == temp) {
return true;
}
}
}
return false;
}


public List<Integer> getOffList(int drawTotalNum) {
List<Integer> list = new ArrayList<Integer>();
for (int i = 1; i <= drawTotalNum; i++) {
if (!isInHistory(i)) {
list.add(i);
}
}
return list;
}


public int getLessThanInHistory(int num) {
int i = 0;
for (int[] history : historys) {
for (int value : history) {
if (value <= num) {
i++;
}
}
}
return i;
}


}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值