package
0.0.0-20210525112244-a601ee6fe7cf
Repository: https://github.com/smartsyoung/leetcode-in-go.git
Documentation: pkg.go.dev

# README

382. 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:

  1. What if the linked list is extremely large and its length is unknown to you?
  2. 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();

解题思路

见程序注释

运气好

100

# Functions

Constructor 构建 Solution head is The linked list's head.

# Structs

Solution 是需要设计的数据结构 Definition for singly-linked list.

# Type aliases

No description provided by the author