LeetCode No.382 Linked List Random Nod

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();

====================================================================================================================================

题目的大意是：从一个链表中返回一个随机值，使得链表中每个值的返回概率都相等

参照wiki上蓄水池抽样：https://en.wikipedia.org/wiki/Reservoir_sampling

假定最终选出的点为temp，第1次选择第一个节点，第二次以1/2的概率选择第二个节点替换第一个节点……如此递推。

对于第m个节点，被选中的概率为：它被选中的概率 * 之后节点都没被选中的概率，即(1/m) * (m/(m+1)) * ((m+1)/(m+2)) * ... * ((n-1)/n) = 1/n.

附上代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
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) {
        this -> head = head ;
    }
    
    /** Returns a random node's value. */
    int getRandom() {
        ListNode* temp = head ;
        int ans = 0 , n = 1 ;
        while ( temp )
        {
            if ( rand() % ( n ++ ) == 0 )
                ans = temp -> val ;
            temp = temp -> next ;
        }
        return ans ;
    }
private :
    ListNode* head ;
};

/**
 * Your Solution object will be instantiated and called as such:
 * Solution obj = new Solution(head);
 * int param_1 = obj.getRandom();
 */