forked from realpacific/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRandomSet.java
39 lines (31 loc) · 883 Bytes
/
RandomSet.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
package hard;
import java.util.Arrays;
public class RandomSet {
public static void main(String[] args) {
int[] sets = new int[32];
for (int i = 0; i < sets.length; i++) {
sets[i] = i;
}
pickMSubset(sets, 28);
}
private static void pickMSubset(int[] sets, int m) {
int[] pick = new int[m];
for (int i = 0; i < pick.length; i++) {
pick[i] = sets[i];
}
for (int i = m; i < sets.length; i++) {
int k = rand(0, i);
if (k < m) {
pick[k] = sets[i];
}
}
print(sets);
print(pick);
}
private static void print(int[] pick) {
System.out.println(Arrays.toString(pick));
}
private static int rand(int low, int high) {
return low + (int) (Math.random() * (high - low + 1));
}
}