【leetcode】382. Linked List Random Node【M】【74】-CSDN博客

本文介绍了一种从单链表中随机选取一个节点的方法，并确保每个节点被选中的概率相同。该方法适用于链表长度未知的情况，且不使用额外的空间。

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

记录整个list

然后shuffle一下，输出

# 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):
        self.l = []
        
        while head:
            self.l += head.val,
            head = head.next
        #print self.l
        """
        @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
        """
        

    def getRandom(self):
        
        random.shuffle(self.l)
        return self.l[0]