1 题目
Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.
Follow up:
What if the linked list is extremely large and its length is unknown to you? Could you solve this efficiently without using extra space?
Example:
// Init a singly linked list [1,2,3].
ListNode head = new ListNode(1);
head.next = new ListNode(2);
head.next.next = new ListNode(3);
Solution solution = new Solution(head);
// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.
solution.getRandom();
2 尝试解
2.1 分析
对于一个链表,要求能够随机返回一个节点的值。
在不占用额外空间的情况下,需要先遍历链表记录其长度,然后生成随机数后,返回即可。
2.2 代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
private:
int size = 0;
ListNode* dummy = new ListNode(0);
ListNode* traverse;
public:
/** @param head The linked list's head.
Note that the head is guaranteed to be not null, so it contains at least one node. */
Solution(ListNode* head) {
dummy->next = head;
traverse = head;
while(traverse){
size ++;
traverse = traverse->next;
}
}
/** Returns a random node's value. */
int getRandom() {
int order = rand()%size;
traverse = dummy->next;
for(int i = 0; i < order; i++){
traverse = traverse->next;
}
return traverse->val;
}
};
/**
* Your Solution object will be instantiated and called as such:
* Solution* obj = new Solution(head);
* int param_1 = obj->getRandom();
*/
3 标准解
class Solution {
public:
ListNode* u;
Solution(ListNode* head) {
u = head;
}
int getRandom() {
int res, len = 1;
ListNode* v = u;
while(v){
if(rand() % len == 0){
res = v->val;
}
len++;
v = v->next;
}
return res;
}
};