随机排序

复制import random

# 原始名单
items = ["Alice", "Bob", "Charlie", "Diana", "Eve"]

# 随机洗牌（原地修改）
random.shuffle(items)
print("打乱后:", items)

# 若需保留原列表，使用 sample 返回新列表
original = ["Alice", "Bob", "Charlie", "Diana", "Eve"]
shuffled = random.sample(original, len(original))
print("新列表:", shuffled)
print("原列表不变:", original)

复制package main

import (
	"fmt"
	"math/rand"
	"time"
)

func main() {
	// 初始化随机种子
	rand.Seed(time.Now().UnixNano())

	items := []string{"Alice", "Bob", "Charlie", "Diana", "Eve"}

	// Fisher-Yates 洗牌算法
	rand.Shuffle(len(items), func(i, j int) {
		items[i], items[j] = items[j], items[i]
	})

	fmt.Println("打乱后:", items)
}

复制// 原始名单
const items = ["Alice", "Bob", "Charlie", "Diana", "Eve"];

// Fisher-Yates 洗牌（原地修改）
for (let i = items.length - 1; i > 0; i--) {
  const j = Math.floor(Math.random() * (i + 1));
  [items[i], items[j]] = [items[j], items[i]];
}

console.log("打乱后:", items);

// 若需保留原列表，先复制再洗牌
const original = ["Alice", "Bob", "Charlie", "Diana", "Eve"];
const shuffled = [...original];
for (let i = shuffled.length - 1; i > 0; i--) {
  const j = Math.floor(Math.random() * (i + 1));
  [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];
}
console.log("新列表:", shuffled);
console.log("原列表不变:", original);