382. Linked List Random Node

     /*
      * 382. Linked List Random Node
      * 2016-8-20 by Mingyang
      * 直接进行长度计算就好了,再根据随机数,便利到指定的位置找到结果
      */
     class Solution {
            int len = 0;
            ListNode head;
            /** @param head The linked list‘s head. Note that the head is guanranteed to be not null, so it contains at least one node. */
            public Solution(ListNode head) {
                this.head = head;
                ListNode cur = head;
                while(cur!=null){
                    len++;
                    cur = cur.next;
                }
            }

            /** Returns a random node‘s value. */
            public int getRandom() {
                int r = (int)(Math.random() * len);
                ListNode cur = head;
                while(r > 0){
                    cur = cur.next;
                    r--;
                }
                return cur.val;
            }
        }
时间: 2024-12-29 04:42:17

382. Linked List Random Node的相关文章

[LeetCode] 382. Linked List Random Node

https://leetcode.com/problems/linked-list-random-node /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { List<ListNode> array = new ArrayList&l

&lt;LeetCode OJ&gt; 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: What if the linked list is extremely large and its length is unknown to you? Could you solve this effi

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: What if the linked list is extremely large and its length is unknown to you? Could you solve this effi

382 Linked List Random Node 链表随机节点

给定一个单链表,随机选择链表的一个节点,并返回相应的节点值.保证每个节点被选的概率一样.进阶:如果链表十分大且长度未知,如何解决这个问题?你能否使用常数级空间复杂度实现?示例:// 初始化一个单链表 [1,2,3].ListNode head = new ListNode(1);head.next = new ListNode(2);head.next.next = new ListNode(3);Solution solution = new Solution(head);// getRand

*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 effic

[leetcode]-Linked List Random Node

题目描述: 给定一个单向的链表,要求以相等的概率返回 要求: 时间复杂度o(n),空间复杂度o(1) 原文描述: 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 an

Linked List Random Node -- LeetCode

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 effic

【Leetcode】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 l

Reservoir Sampling-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:What if the linked list is extremely large and its length is unknown to you? Could you solve this effic