如何在特定范围内生成随机int值？
以下方法存在与整数溢出相关的错误：
randomNum = minimum + (int)(Math.random() * maximum);
// Bug: `randomNum` can be bigger than `maximum`.
Random rn = new Random();
int n = maximum - minimum + 1;
int i = rn.nextInt() % n;
randomNum = minimum + i;
// Bug: `randomNum` can be smaller than `minimum`.
当前回答
我已经创建了一个方法来获取给定范围内的唯一整数。
/*
* minNum is the minimum possible random number
* maxNum is the maximum possible random number
* numbersNeeded is the quantity of random number required
* the give method provides you with unique random number between min & max range
*/
public static Set<Integer> getUniqueRandomNumbers( int minNum , int maxNum ,int numbersNeeded ){
if(minNum >= maxNum)
throw new IllegalArgumentException("maxNum must be greater than minNum");
if(! (numbersNeeded > (maxNum - minNum + 1) ))
throw new IllegalArgumentException("numberNeeded must be greater then difference b/w (max- min +1)");
Random rng = new Random(); // Ideally just create one instance globally
// Note: use LinkedHashSet to maintain insertion order
Set<Integer> generated = new LinkedHashSet<Integer>();
while (generated.size() < numbersNeeded)
{
Integer next = rng.nextInt((maxNum - minNum) + 1) + minNum;
// As we're adding to a set, this will automatically do a containment check
generated.add(next);
}
return generated;
}
其他回答
要生成“介于两个数字之间”的随机数，请使用以下代码：
Random r = new Random();
int lowerBound = 1;
int upperBound = 11;
int result = r.nextInt(upperBound-lowerBound) + lowerBound;
这将为您提供一个介于1（含）和11（不含）之间的随机数，因此通过添加1来初始化上限值。例如，如果要生成1到10之间的随机数，则使用11而不是10初始化上限数。
因为Android的问题在这里重定向，这就是你如何使用Kotlin：
val r = (0..10).random() // A random integer between 0 and 10 inclusive
这适用于Kotlin 1.3及更高版本。请参阅此答案。
使用nexttint（n）方法为最小值和最大值的差值生成一个随机数，然后将最小值添加到结果中：
Random rn = new Random();
int result = rn.nextInt(max - min + 1) + min;
System.out.println(result);
Use:
minValue + rn.nextInt(maxValue - minValue + 1)
int func(int max, int min){
int range = max - min + 1;
// Math.random() function will return a random no between [0.0,1.0).
int res = (int) ( Math.random()*range)+min;
return res;
}
