如何在特定范围内生成随机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`.
当前回答
使用Java 8 Streams，
传递初始容量-多少个数字将randomBound从x传递到randomBoud是否为已排序传递true/false传递新的Random（）对象
public static List<Integer> generateNumbers(int initialCapacity, int randomBound, Boolean sorted, Random random) {
List<Integer> numbers = random.ints(initialCapacity, 1, randomBound).boxed().collect(Collectors.toList());
if (sorted)
numbers.sort(null);
return numbers;
}
在本例中，它从1-Randombound生成数字。
其他回答
以前的大多数建议都不考虑“溢出”。例如：min=整数.min_VALUE，max=100。到目前为止，我采用的正确方法之一是：
final long mod = max- min + 1L;
final int next = (int) (Math.abs(rand.nextLong() % mod) + min);
以下是使用Random和forEach的另一个示例
int firstNum = 20;//Inclusive
int lastNum = 50;//Exclusive
int streamSize = 10;
Random num = new Random().ints(10, 20, 50).forEach(System.out::println);
要生成“介于两个数字之间”的随机数，请使用以下代码：
Random r = new Random();
int lowerBound = 1;
int upperBound = 11;
int result = r.nextInt(upperBound-lowerBound) + lowerBound;
这将为您提供一个介于1（含）和11（不含）之间的随机数，因此通过添加1来初始化上限值。例如，如果要生成1到10之间的随机数，则使用11而不是10初始化上限数。
您可以使用以下方法来执行此操作：
int range = 10;
int min = 5
Random r = new Random();
int = r.nextInt(range) + min;
我已经创建了一个方法来获取给定范围内的唯一整数。
/*
* 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;
}
