-
Notifications
You must be signed in to change notification settings - Fork 3
/
382.cpp
38 lines (36 loc) · 868 Bytes
/
382.cpp
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* head;
Solution(ListNode* head) {
this->head = head;
}
int getRandom() {
int res = head->val;
int i = 2;
ListNode* curr = head->next;
while (curr) {
int rnd = rand() % i;
if (rnd == 0) {
swap(head->val, curr->val);
}
i++;
curr = curr->next;
}
return res;
}
};
/**
* Your Solution object will be instantiated and called as such:
* Solution* obj = new Solution(head);
* int param_1 = obj->getRandom();
*/