模拟概率抽奖伪算法

public class TestLottery {

static int BASE_RANDOM_NUM=1000;

private static int getProbabilityIndex(final List<Double> probabilityList){ Map<Integer,Double> mapRates= calculateBaseProbability(probabilityList); int randomProbability=RandomUtils.nextInt(BASE_RANDOM_NUM); Set<Entry<Integer, Double>> sets=mapRates.entrySet(); for(Entry<Integer, Double> entry:sets){ if (entry.getValue() >= randomProbability && entry.getValue() <= BASE_RANDOM_NUM) { return entry.getKey(); } } return -1; } private static Map<Integer,Double> calculateBaseProbability(final List<Double> probabilityList){ Map<Integer,Double> mapRates=new HashMap<Integer, Double>(); double sumProbability=0.0; int index=0; Iterator<Double> itor= probabilityList.iterator(); while(itor.hasNext()){ double probability=itor.next(); if(probability>0){ sumProbability+=probability; mapRates.put(index, sumProbability*BASE_RANDOM_NUM); } index++; } return mapRates; } public static List<Double> createDoubleList(){ List<Double> orignalRates=new ArrayList<Double>(); orignalRates.add(0.0); orignalRates.add(0.0); orignalRates.add(0.6); orignalRates.add(0.3); orignalRates.add(0.1); return orignalRates; } public static void main(String[] args) { Map<Integer,Double> proMap=new HashMap<Integer, Double>(); double sumCount=100000; List<Double> orignalRates=createDoubleList(); for (double i = 0; i < sumCount; i++) { int index =getProbabilityIndex(orignalRates); if(proMap.containsKey(index)){ proMap.put(index, proMap.get(index)+1.0); }else{ proMap.put(index, 1.0); } } Set<Entry<Integer, Double>> setEntry=proMap.entrySet(); for(Entry<Integer, Double> entry:setEntry){ System.out.println( entry.getKey()+"("+entry.getValue()+")->rate:"+ entry.getValue()/sumCount); } } }






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值