LeetCode #382: Linked List Random Node

原创 2016年08月29日 09:06:40

Problem Statement

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

Analysis

Reservoir sampling

Reservoir Sampling Sample size 1: Suppose we see a sequence of items, one at a time. We want to keep a single item in memory, and we want it to be selected at random from the sequence. If we know the total number of items (n), then the solution is easy: select an index i between 1 and n with equal probability, and keep the i-th element. The problem is that we do not always know n in advance. A possible solution is the following:

  • Keep the first item in memory.
  • When the i-th item arrives (for i>1):
    • with probability 1/i, keep the new item instead of the current item; or equivalently
    • with probability 1-1/i, keep the current item and discard the new item.

So:
* when there is only one item, it is kept with probability 1;
* when there are 2 items, each of them is kept with probability 1/2;
* when there are 3 items, the third item is kept with probability 1/3, and each of the previous 2 items is also kept with probability (1/2)(1-1/3) = (1/2)(2/3) = 1/3;
* by induction, it is easy to prove that when there are n items, each item is kept with probability 1/n.

Solution

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):

    def __init__(self, head):
        """
        @param head The linked list's head.
        Note that the head is guaranteed to be not null, so it contains at least one node.
        :type head: ListNode
        """
        self.head = head


    def getRandom(self):
        """
        Returns a random node's value.
        :rtype: int
        """
        from random import randint


        p = self.head
        res = p.val

        i = 2
        p = p.next
        while p:
            if randint(1, i) == 1:
                res = p.val
            p = p.next
            i += 1

        return res



# Your Solution object will be instantiated and called as such:
# obj = Solution(head)
# param_1 = obj.getRandom()
版权声明:本文为博主原创文章,未经博主允许不得转载。

[leetcode] 382. Linked List Random Node 解题报告

题目链接: https://leetcode.com/problems/linked-list-random-node/ Given a singly linked list, return a ...

[leetcode] 382. Linked List Random Node

Given a singly linked list, return a random node's value from the linked list. Each node must have t...

LeetCode:382 Linked List Random Node

382. Linked List Random Node Given a singly linked list, return a random node’s value from the lin...
  • Wisimer
  • Wisimer
  • 2016年08月11日 09:45
  • 670

Leetcode 382. Linked List Random Node

382. Linked List Random Node Total Accepted: 4707 Total Submissions: 10107 Difficulty: Medium Gi...

LeetCode[382] Linked List Random Node

Given a singly linked list, return a random node's value from the linked list. Each node must have t...

[Leetcode]382. Linked List Random Node

题目:[leetcode]Given a singly linked list, return a random node’s value from the linked list. Each nod...

leetcode382 Linked List Random Node java

DescriptionGiven a singly linked list, return a random node’s value from the linked list. Each node ...

LeetCode 382. Linked List Random Node 题解(C++)

Given a singly linked list, return a random node's value from the linked list. Each node must have t...

<LeetCode OJ> 382. Linked List Random Node

Given a singly linked list, return a random node's value from the linked list. Each node must have t...

LeetCode:382. Linked List Random Node(蓄水池抽样算法C++)

382. Linked List Random NodeGiven a singly linked list, return a random node’s value from the linked...
  • BestZem
  • BestZem
  • 2016年08月23日 16:18
  • 615
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode #382: Linked List Random Node
举报原因:
原因补充:

(最多只允许输入30个字)