382. Linked List Random Node (Solution 1)

2020-10-25 14:31:26 阅读：138 来源： 互联网

标签：Node head ListNode cur list Random List length var

package LeetCode_382

import java.util.*

/**
 * 382. Linked List Random Node
 *https://leetcode.com/problems/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:
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();
 * */
class ListNode(var `val`: Int) {
    var next: ListNode? = null
}

/*
  solution 1: calculate the length of ListNode, then return node's value by a random num from length;
* solution Follow up: Reservoir Sampling, 1/i * (1-1/(i+1)) * (1-1/(i+2)) * (1-1/(i+3)) .. (1-1/n);
* */
class Solution(head: ListNode?) {

    var length = 0
    var cur = head
    var head2 = head

    init {
        getLength(cur)
    }

    private fun getLength(head_: ListNode?) {
        var head = head_
        while (head != null) {
            length++
            head = head.next
        }
    }

    /** @param head The linked list's head.
    Note that the head is guaranteed to be not null, so it contains at least one node. */

    /** Returns a random node's value. */
    fun getRandom(): Int {
        var cur = head2
        var randomNum = Random().nextInt(length)
        while (randomNum > 0) {
            randomNum--
            cur = cur?.next
        }
        return cur!!.`val`
    }
}
/**
 * Your Solution object will be instantiated and called as such:
 * var obj = Solution(head)
 * var param_1 = obj.getRandom()
 */

标签：Node,head,ListNode,cur,list,Random,List,length,var
来源： https://www.cnblogs.com/johnnyzhao/p/13873333.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

382. Linked List Random Node (Solution 1)