# [leetcode][382] Linked List Random Node

153人阅读 评论(0)

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

import random
# 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
self.n = 0
while head:
head = head.next
self.n += 1

def getRandom(self):
"""
Returns a random node's value.
:rtype: int
"""
v = random.randint(0,self.n-1)
head = self.head
while v>0:
head = head.next
v -= 1
return head.val

# Your Solution object will be instantiated and called as such:
# obj = Solution(head)
# param_1 = obj.getRandom()

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：160598次
• 积分：3670
• 等级：
• 排名：第8842名
• 原创：198篇
• 转载：18篇
• 译文：3篇
• 评论：48条
weibo
github
文章分类
最新评论