Linked List Random Node

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

一种简单的解法：用一个count变量，记录链表的大小，取（0～size-1）的随机值，循环遍历取出对应的值。

ListNode head;
    int size;
    public Solution(ListNode head) {
        this.head = head;
        ListNode pointer = head;
        while(pointer != null){
            size++;
            pointer = pointer.next;
        }
    }

    /** Returns a random node's value. */
    public int getRandom() {
        ListNode pointer = head;
        int rand = new Random().nextInt(size);//why 0~n-1步
        while(rand>0){
            pointer = pointer.next;
            rand--;
        }
        return pointer.val;
    }

sdfasfd