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

Subscribe to see which companies asked this question

分析：借助采用ArrayList存储链表上的值，然后随机生成返回数组的下标。

/**
	 * @param head
	 *            The linked list's head. Note that the head is guaranteed to be
	 *            not null, so it contains at least one node.
	 */
	ArrayList<Integer> list;// 定义一个list来存储链表上的元素

	public Solution(ListNode head) {
		list = new ArrayList<Integer>();
		ListNode node = head;
		while (node != null) {
			list.add(node.val);
			node = node.next;
		}
	}

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

		if (list.size() <= 1) {// 如果全排列的个数小于等于1个，则只需要返回base数组即可。
			return (int) list.get(0);
		}
		/* 随机生成一个下标 */
		Random random = new Random();
		int i = random.nextInt(list.size());// random.nextInt(20)，任意取[0,20)之间整数，其中0可以取到，20取不到
		return (int) list.get(i);
	}