384. Shuffle an Array
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();
//https://discuss.leetcode.com/topic/54022/c-solution-with-fisher-yates-algorithm/6
class Solution {
vector<int> arr, idx;
public:
Solution(vector<int> nums) {
srand(time(NULL));
arr.resize(nums.size());
idx.resize(nums.size());
;i<nums.size();i++){
arr[i] = nums[i];
idx[i] = nums[i];
}
}
/** Resets the array to its original configuration and return it. */
vector<int> reset() {
;i<arr.size();i++)
arr[i] = idx[i];
return arr;
}
/** Returns a random shuffling of the array. */
vector<int> shuffle() {
int i,j;
; i > ; i--) {
j = rand() % (i + );
swap(arr[i], arr[j]);
}
return arr;
}
};
//C
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
typedef struct
{
int size;
int *BaseNum;
int *RandNum;
}Solution;
Solution* solutionCreate(int* nums, int size)
{
Solution* solu;
solu = (Solution*)malloc(sizeof (Solution));
solu->size = size;
solu->BaseNum = (int *)malloc(sizeof(int)*size);
solu->RandNum = (int *)malloc(sizeof(int)*size);
memcpy(solu->BaseNum, nums, sizeof(int)*size);
memcpy(solu->RandNum, nums, sizeof(int)*size);
solu->size = size;
return solu;
}
int* solutionReset(Solution* obj,int *returnSize) {
return obj->BaseNum;
}
int* solutionShuffle(Solution* obj,int *returnSize) {
int i,j,k;
int temp[obj->size];
srand((unsigned int)time(NULL));
j = ;
while (j < obj->size)
{
temp[j] = rand()%obj->size;
;i<j;i++)
{
if (temp[i] == temp[j]||temp[j] == obj->size)
break;
}
if (i<j)
continue;
j++;
}
;k < obj->size;k++)
{
//printf ("%d\t",temp[k]);
obj->RandNum[k] = obj->BaseNum[temp[k]];
}
return obj->RandNum;
}
void solutionFree(Solution* obj) {
if(obj->BaseNum != NULL){
free(obj->BaseNum);
obj->BaseNum = NULL;
}
if(obj->RandNum != NULL){
free(obj->RandNum);
obj->RandNum = NULL;
}
obj->size = ;
if(obj != NULL){
free(obj);
obj = NULL;
}
}
/**
* Your Solution struct will be instantiated and called as such:
* struct Solution* obj = solutionCreate(nums, size);
* int* param_1 = solutionReset(obj);
* int* param_2 = solutionShuffle(obj);
* solutionFree(obj);
*/
int main(void) {
//freopen("../tmp", "r", stdin);
Solution *st;
];
int size;
scanf("%d", &size);
//getchar();
; i < size; ++i) {
scanf("%d", &nums[i]);
}
st = solutionCreate(nums, size);
int *p1 = solutionReset(st, &size);
printf("the orignal:");
; i < size; ++i) {
printf("%d ", *p1);
p1++;
}
printf("\n");
int *p2 = solutionShuffle(st, &size);
printf("after shuffle:");
; i < size; ++i) {
printf("%d ", *p2);
p2++;
}
printf("\n");
if(st != NULL){
solutionFree(st);
}
;
}
384. Shuffle an Array的更多相关文章
- leetcode 384. Shuffle an Array
384. Shuffle an Array c++ random函数:https://www.jb51.net/article/124108.htm rand()不需要参数,它会返回一个从0到最大随机 ...
- 384. Shuffle an Array数组洗牌
[抄题]: Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. i ...
- Java [Leetcode 384]Shuffle an Array
题目描述: Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. i ...
- [LeetCode] 384. Shuffle an Array 数组洗牌
Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. int[] n ...
- LC 384. Shuffle an Array
Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. int[] n ...
- 【LeetCode】384. Shuffle an Array 解题报告(Python & C++)
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 库函数 Fisher–Yates 洗牌 水塘抽样 日 ...
- 384. Shuffle an Array(java,数组全排列,然后随机取)
题目: Shuffle a set of numbers without duplicates. 分析: 对一组不包含重复元素的数组进行随机重排,reset方法返回最原始的数组,shuffle方法随机 ...
- 384 Shuffle an Array 打乱数组
打乱一个没有重复元素的数组.示例:// 以数字集合 1, 2 和 3 初始化数组.int[] nums = {1,2,3};Solution solution = new Solution(nums) ...
- [LeetCode] Shuffle an Array 数组洗牌
Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. int[] n ...
随机推荐
- servlet过滤器实现维护项目
最近公司需要系统维护,提出要建一个维护系统,要求: 1.访问公司域名跳到系统首页 2.点击首页的任意按钮给出维护提示信息 3.用户访问之前收藏的任意系统链接跳转到首页 下面介绍下用过滤器实现上述需求 ...
- Java Io(数据输入输出流)
Java Io 字节流中的DataInputStream 和 DataOutputStream,使用流更加方便,是流的一个扩展,更方便读取int, long,字符等类型数据. 事例代码如下: pack ...
- phpDocumentor 注释语法详解
PHPDocumentor是强大的代码注释生成器,本文对各个参数进行了简单地的总结: @abstract-------------使用@abstract标记来声明一个方法,类变量或类必须重新定义子类中 ...
- SVN钩子说明
post-commit在提交完成,成功创建版本之后执行该钩子,提交已经完成,不可更改,因此本脚本的返回值被忽略. post-lock对文件进行加锁操作之后执行该脚本 post-revprop-chan ...
- 'ModelOptions' object has no attribute 'get_field_names
peewee安装时随意了点.装了2.8.0的. 倒回到2.6.0就好了. sudo pip uninstall peewee sudo pip install peewee==2.6.0
- linux——基本配置
环境:Ubuntu 12.04.2 LTS (GNU/Linux 3.5.0-23-generic i686) 网络配置 #临时改变 #修改IP和子网掩码 sudo ifconfig eth0 192 ...
- Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in ...
- 小波变换C++实现(一)----单层小波变换
文章转自: http://www.cnblogs.com/IDoIUnderstand/archive/2013/03/30/3280724.html [小波变换]STL版 一维离散小波变换(DWT) ...
- join
一句话 join(param) 是把 array 连城一个字符串,中间用 param隔开
- Metronic 与 VS2013/2015 合作开发
Metronic 与 VS2013/2015 合作开发 去年购买了一个:METRONIC (http://www.keenthemes.com/) ,最近下了最新的版本:V3.7 ,解压缩后,目录 ...