leetcode-382-链表随机节点

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    ListNode head;
    Random random;
    /** @param head The linked list's head.
        Note that the head is guaranteed to be not null, so it contains at least one node. */
    public Solution(ListNode head) {
        this.head = head;
        random = new Random(); 
    }
    
    /** Returns a random node's value. */
    public int getRandom() {
        int i = 1;
        int ans = 0;
        ListNode p = head;
        // 循环遍历链表
        while (p != null) {
            // 生成一个 [0, i) 之间的整数
            // 这个整数等于 0 的概率就是 1/i
            if (random.nextInt(i) == 0) {
                ans = p.val;
            }
            p = p.next;
            i++;
        }
        return ans;
    }
}

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

扩展一下：随机 K 个节点 随机选中的概率由 1/i 变为 k/i

class Solution {
    ListNode head;
    Random random;
    /** @param head The linked list's head.
        Note that the head is guaranteed to be not null, so it contains at least one node. */
    public Solution(ListNode head) {
        this.head = head;
        random = new Random(); 
    }
    
    /** Returns a random node's value. */
    public int[] getRandom(int k) {
        int[] ans = new int[k];
        ListNode p = head;
        // 前 k 个元素先默认选上
	    for (int j = 0; j < k && p != null; j++) {
	        res[j] = p.val;
	        p = p.next;
	    }
	    int i = k + 1;
        // 循环遍历至链表尾结点
        while (p != null) {
        	// 生成一个 [0, i) 之间的整数
        	int j = random.nextInt(i);
            // 这个整数小于 k 的概率就是 k/i
            if (j < k) {
                res[j] = p.val;
            }
            p = p.next;
            i++;
        }
        return ans;
    }
}