1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
// 380. Insert Delete GetRandom O(1)
#include "leetcode.h"
/*
Implement the RandomizedSet class:
RandomizedSet() Initializes the RandomizedSet object.
bool insert(int val) Inserts an item val into the set if not present.
Returns true if the item was not present, false otherwise. bool remove(int val)
Removes an item val from the set if present. Returns true if the item was
present, false otherwise. int getRandom() Returns a random element from the
current set of elements (it's guaranteed that at least one element exists when
this method is called). Each element must have the same probability of being
returned.
You must implement the functions of the class such that each function works in
average O(1) time complexity.
*/
typedef struct {
int val;
struct node *next;
} node;
typedef struct {
node **lists;
int *counts;
int total;
} RandomizedSet;
RandomizedSet *randomizedSetCreate() {
RandomizedSet *obj = (RandomizedSet *)malloc(sizeof(RandomizedSet));
obj->lists = (node **)calloc(128, sizeof(node *));
obj->counts = (int *)calloc(128, sizeof(int));
obj->total = 0;
return obj;
}
bool randomizedSetInsert(RandomizedSet *obj, int val) {
int key = abs(val) % 128;
node *new_node, *tmp_node, *pre_node;
if (obj->lists[key] == NULL) {
new_node = (node *)malloc(sizeof(node));
new_node->val = val;
new_node->next = NULL;
obj->lists[key] = new_node;
} else {
tmp_node = obj->lists[key];
while (tmp_node) {
pre_node = tmp_node;
if (tmp_node->val == val)
return false;
tmp_node = tmp_node->next;
}
if (tmp_node == NULL) {
new_node = (node *)malloc(sizeof(node));
new_node->val = val;
new_node->next = NULL;
pre_node->next = new_node;
}
}
obj->counts[key]++;
obj->total++;
return true;
}
bool randomizedSetRemove(RandomizedSet *obj, int val) {
node *pre_node, *tmp_node;
int key = abs(val) % 128;
if (obj->lists[key] == NULL) {
return false;
} else {
tmp_node = obj->lists[key];
while (tmp_node) {
if (tmp_node->val == val) {
if (pre_node)
pre_node->next = tmp_node->next;
else
obj->lists[key] = tmp_node->next;
free(tmp_node);
obj->counts[key]--;
obj->total--;
return true;
}
pre_node = tmp_node;
tmp_node = tmp_node->next;
}
return false;
}
}
int randomizedSetGetRandom(RandomizedSet *obj) {
int pos = rand() % obj->total;
int i, sum = 0, key = 0;
node *tmp_node;
for (i = 0; i < 128; i++) {
if (pos >= obj->counts[i]) {
pos -= obj->counts[i];
} else {
key = i;
break;
}
}
tmp_node = obj->lists[key];
while (tmp_node && pos) {
tmp_node = tmp_node->next;
pos--;
}
return tmp_node->val;
}
void randomizedSetFree(RandomizedSet *obj) {
int i;
node *pre_node, *tmp_node;
for (i = 0; i < 128; i++) {
tmp_node = obj->lists[i];
while (tmp_node) {
pre_node = tmp_node;
tmp_node = tmp_node->next;
free(pre_node);
}
}
free(obj->counts);
free(obj);
}
|