挑战精度问题
parent
2518c0821d
commit
0814ed225c
|
@ -110,8 +110,8 @@ public class ChallengeLogic {
|
||||||
} else if (model == 1 && win == 0) {
|
} else if (model == 1 && win == 0) {
|
||||||
//没打过
|
//没打过
|
||||||
int[][] reward1 = sChallengeConfig.getReward1();
|
int[][] reward1 = sChallengeConfig.getReward1();
|
||||||
int ratio = 0;
|
double ratio = 0;
|
||||||
if (type == 1) {//回合数
|
if (type == 1) {//回合数
|
||||||
long times = bout;
|
long times = bout;
|
||||||
for (int[] percent : reward1) {
|
for (int[] percent : reward1) {
|
||||||
if (percent[0] > times) {
|
if (percent[0] > times) {
|
||||||
|
@ -146,7 +146,7 @@ public class ChallengeLogic {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
LOGGER.info("no pass reward percent");
|
LOGGER.info("no pass reward percent");
|
||||||
builder.setPercentReward(ratio);
|
builder.setPercentReward((int)ratio);
|
||||||
}
|
}
|
||||||
return comDropMap;
|
return comDropMap;
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue