主要思想是从最后一个数到第二个数依次遍历,每次产生一个小于当前数的随机数k,再将list[k]和当前数交换
import java.util.Random;
public class Shuffle {
static void shuffle(int[] list) {
Random r= new Random();
for(int i= list.length-1; i>1; i--) {
int j = r.nextInt(i);
int temp = list[i];
list[i] = list[j];
list[j] = temp;
}
for(int i=0; i<list.length; i++)
System.out.print(list[i]+" ");
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] list = {1,2,3,4,5,6,7,8,9,10};
shuffle(list);
}
}