Leetcode 384. 打乱数组（DAY 153）---- LeetCode 精选 TOP 面试题

ゞ浴缸里的玫瑰 2022-09-08 03:53 218阅读 0赞

### 文章目录 ###

*   *  原题题目
     *  代码实现（首刷看解 经典随机洗牌原理）

--------------------

## 原题题目 ##

--------------------

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_Q1NETiBATG92ZSA2_size_38_color_FFFFFF_t_70_g_se_x_16]

--------------------

## 代码实现（首刷看解 经典随机洗牌原理） ##

--------------------

class Solution { 
    public:
        vector<int> pre,now;
        Solution(vector<int>& nums) { 
            pre = nums;
            now = nums;
        }
        
        /** Resets the array to its original configuration and return it. */
        vector<int> reset() { 
            return pre;
        }
        
        /** Returns a random shuffling of the array. */
        vector<int> shuffle() { 
            now = pre;
            for(int i=1;i<now.size();++i)
            { 
                int pos = rand()%(i+1);
                if(pos != i)    swap(now[pos],now[i]);
            }   
            return now;
        }
    };
    
    /** * Your Solution object will be instantiated and called as such: * Solution* obj = new Solution(nums); * vector<int> param_1 = obj->reset(); * vector<int> param_2 = obj->shuffle(); */

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_Q1NETiBATG92ZSA2_size_38_color_FFFFFF_t_70_g_se_x_16]: /images/20220829/39860b4fc8c64a84b87006e8b92f7e18.png