<strike id="wuq0a"></strike>

<ul id="wuq0a"></ul>

[LeetCode] Shuffle an Array

Baaaan 發布于2019-08-15 15:46 / 1615人閱讀

Problem

Shuffle a set of numbers without duplicates.

Example

// Init an array with set 1, 2, and 3.
int[] nums = {1,2,3};
Solution solution = new Solution(nums);

// Shuffle the array [1,2,3] and return its result. Any permutation of [1,2,3] must equally likely to be returned.
solution.shuffle();

// Resets the array back to its original configuration [1,2,3].
solution.reset();

// Returns the random shuffling of array [1,2,3].
solution.shuffle();

Solution

class Solution {
    private int[] nums;
    public Solution(int[] nums) {
        this.nums = nums;
    }
    
    /** Resets the array to its original configuration and return it. */
    public int[] reset() {
        return nums;
    }
    
    /** Returns a random shuffling of the array. */
    public int[] shuffle() {
        int[] rand = new int[nums.length];
        for (int i = 0; i < nums.length; i++) {
            //we shuffle the array by getting random index j 
            //which is less than current index i, 
            //and swap their values
            int j = (int) (Math.random()* (i+1)); //(i+1) is the range
            rand[i] = rand[j];
            rand[j] = nums[i];
        }
        return rand;
    }
}

/**
 * Your Solution object will be instantiated and called as such:
 * Solution obj = new Solution(nums);
 * int[] param_1 = obj.reset();
 * int[] param_2 = obj.shuffle();
 */

云服務器 GPU云服務器 Shuffle LeetCode str_shuffle LeetCode_String

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/69262.html

[LeetCode] 384. Shuffle an Array

Problem Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3.int[] nums = {1,2,3};Solution solution = new Solution(nums); // Shuffle the array [1,2,3] and return...

Joyven 2019-08-16 13:43 評論0 收藏0
leetcode384. Shuffle an Array

摘要：題目要求實現和方法，分別能夠完成數組的隨機打亂和還原。隨機打亂即該數組中元素的所有排列組合結果都能夠以等比例的概率輸出。下面解釋一下證明，即為何每個該結果是等概率的排列組合結果。題目要求 Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. int[...

cooxer 2019-08-16 17:50 評論0 收藏0
也談前端面試常見問題之『數組亂序』

摘要：看完部分的源碼，首先迫不及待想跟大家分享的正是本文主題數組亂序。這是一道經典的前端面試題，給你一個數組，將其打亂，返回新的數組，即為數組亂序，也稱為洗牌問題。關于數組亂序，正確的解法應該是，復雜度。前言終于可以開始 Collection Functions 部分了。可能有的童鞋是第一次看樓主的系列文章，這里再做下簡單的介紹。樓主在閱讀 underscore.js 源碼的時候，學到...

tracy 2019-08-19 18:42 評論0 收藏0
JDK Collections.shuffle(List<?> list, Random

摘要：的源碼如下一首先是判斷要打亂的的屬性的和是否實現接口如果的小于或者實現了接口，則直接交換內元素的位置。以上內容如有不正確的地方，歡迎支持。 jdk的源碼如下 public static void shuffle(List list, Random rnd) { int size = list.size(); if (size < SHUFFLE_THRE...

Aomine 2019-08-15 14:48 評論0 收藏0
JavaScript30秒，從入門到放棄之Array（五）

摘要：原文地址秒，從入門到放棄之五博客地址秒，從入門到放棄之五水平有限，歡迎批評指正從給定的數組中隨機選出指定個數的數組元素。否則判斷數組元素是否大于或者等于指定元素，尋找過程與前邊類似。原文地址：JavaScript30秒，從入門到放棄之Array（五）博客地址：JavaScript30秒，從入門到放棄之Array（五）水平有限，歡迎批評指正 sampleSize Gets n...

dunizb 2019-08-26 11:41 評論0 收藏0