zoukankan      html  css  js  c++  java
  • [TS] Swap two element in the array (mutation)

    Shuffling is a common process used with randomizing the order for a deck of cards. The key property for a perfect shuffle is that each item should have an equal probability to end up in any given index.

    In this lesson we discuss the concept behind the simple modern fisher yates shuffle and implement it in JavaScript / TypeScript.

     

    function randomInt(start: number, before: number) {
      return start + Math.floor(Math.random() * (before - start));
    }
    
     function shuffle<T>(array: T[]): T[] {
      array = array.slice();
    
      for (let i = 0; i < array.length; i++) {
        const randomChoiceIndex = randomInt(i, array.length);
        [array[i], array[randomChoiceIndex]] = [array[randomChoiceIndex], array[i]]; // swap element in array
      }
    
      return array;
    }
  • 相关阅读:
    关于ping github.com超时的解决办法
    git使用过程中的若干问题笔记
    PAT甲级1017题解——模拟排序
    第七章4
    第七章3
    第七章2
    第七章1
    第六章4
    第六章3
    第六章2
  • 原文地址:https://www.cnblogs.com/Answer1215/p/7624220.html
Copyright © 2011-2022 走看看