zoukankan      html  css  js  c++  java
  • 数组随机排序

    方法一:
    var arr = [1,2,3,4,5,6,7,8,9,10];
    function randSort1(arr){
    for(var i = 0,len = arr.length;i < len; i++ ){
    var rand = parseInt(Math.random()*len);
    var temp = arr[rand];
    arr[rand] = arr[i];
    arr[i] = temp;
    }
    return arr;
    }
    console.log(randSort1(arr));

    方法二:
    var arr = [1,2,3,4,5,6,7,8,9,10];
    function randSort2(arr){
    var mixedArray = [];
    while(arr.length > 0){
    var randomIndex = parseInt(Math.random()*arr.length);
    mixedArray.push(arr[randomIndex]);
    arr.splice(randomIndex, 1);
    }
    return mixedArray;
    }
    console.log(randSort2(arr));

    方法三:
    var arr = [1,2,3,4,5,6,7,8,9,10];
    arr.sort(function(){
    return Math.random() - 0.5;
    })
    console.log(arr);

  • 相关阅读:
    vijos 1379 字符串的展开
    BZOJ 4597 随机序列
    BZOJ 2303 方格染色
    BZOJ 2654 tree
    BZOJ 4198 荷马史诗
    BZOJ 1555 KD之死
    不重复数字
    Rails
    Train Problem I
    Key Set HDU
  • 原文地址:https://www.cnblogs.com/Liu-yz/p/10178227.html
Copyright © 2011-2022 走看看