382. Linked List Random Node(unsolved)

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

解答：
方法1: 由于可以知道长度，那么可以先考虑把所有的遍历一遍，然后找出长度，然后随机取某个位置。

/**
 * 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) {
        len=0;
        ListNode* cur=head;
        this->head=head;
        while(cur!=NULL)
        {
            len++;
            cur=cur->next;
        }
    }

    /** Returns a random node's value. */
    int getRandom() {

        int t=rand()%len;
        ListNode* cur=head;

        while(t--)
        {
            cur=cur->next;
        }

        return cur->val;


    }

private:
    int len;
    ListNode* head;
};

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

方法2:
在不知道长度的情况下，可以在遍历时，按照概率保留遍历到的数，比如第2个节点1/2，第三个节点按照1/3的概率留下来。就是水塘抽样法

/**
 * 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* cur=head;
        int res=cur->val;
        int cnt=1;
        while(cur)
        {
            if(rand()%cnt==0) res=cur->val;
            cur=cur->next;
            cnt++;
        }

        return res;


    }

private:
    int len;
    ListNode* head;
};

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