JS数组乱序之 Fisher–Yates方式

最新推荐文章于 2024-05-21 19:09:41 发布

shuffle_boy

最新推荐文章于 2024-05-21 19:09:41 发布

阅读量99

点赞数

文章标签： javascript js

本文章版权归shuffleboy所有，转载请注明出处

本文链接：https://blog.csdn.net/shuffle_boy/article/details/118994247

版权

<!DOCTYPE html>
<html lang="en">

<head>
  <meta charset="UTF-8">
  <meta name="viewport"
    content="width=device-width, initial-scale=1.0, maximum-scale=1.0, minimum-scale=1.0, user-scalable=no">
  <meta http-equiv="X-UA-Compatible" content="ie=edge">
  <title>Document</title>
</head>

<body>
  <script>
    let arr = [1, 2, 3, 4, 5, 6, 7]
    
    function shuffle(arr) {
      for (let i = arr.length; i; i--) {
        let j = Math.floor(Math.random() * i);
        [arr[i - i], arr[j]] = [arr[j], arr[i - 1]]
      }
      return arr
    }
    console.log(shuffle(arr))
  </script>
</body>

</html>

参考：
https://blog.csdn.net/lhkaikai/article/details/25627161
https://zhuanlan.zhihu.com/p/259652066

优惠劵

shuffle_boy

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
JS数组乱序之 Fisher–Yates方式

<!DOCTYPE html><html lang="en"><head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, minimum-scale=1.0, user-scalable=no"> <meta http-equiv="X-UA
复制链接

扫一扫