Java list乱序的实现三种方法

  List<Integer> numbers = new ArrayList<Integer>();
          for(int i = 1; i <= 20; i++ ) {
              numbers.add(i);
          }
 System.out.println("原来的顺序为:" + numbers);
 Collections.shuffle(numbers);
System.out.println("打乱后的顺序:" + numbers);

public static void customShuffle(List<Integer> list) {
        Random random = new Random();
        for (int i = list.size() - 1; i > 0; i--) {
            int j = random.nextInt(i + 1);
            int temp = list.get(i);
            list.set(i, list.get(j));
            list.set(j, temp);
        }
    }

    public static void main(String[] args) {
        List<Integer> numbers = new ArrayList<>();
        for (int i = 1; i <= 20; i++) {
            numbers.add(i);
        }

        System.out.println("原始顺序：" + numbers);

        customShuffle(numbers);

        System.out.println("自定义打乱后的顺序：" + numbers);
    }

 List<Integer> numbers = new ArrayList<Integer>();
               for(int i = 100; i >= 87;i-- ) {
                   numbers.add(i);
               }

               System.out.println("原始顺序为:" + numbers);

               List<Integer> shuffledNumbers = numbers.stream()
                       .sorted((a,b) ->Math.random() > 0.5 ? 1 : -1)
                       .collect(Collectors.toList());

               System.out.println("打乱后的顺序为:" + shuffledNumbers);
           }