首页 > 代码库 > [LeetCode] 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<>(); /** @param head The linked list‘s head. Note that the head is guaranteed to be not null, so it contains at least one node. */ public Solution(ListNode head) { ListNode p = head; while (p != null) { array.add(p); p = p.next; } } /** Returns a random node‘s value. */ public int getRandom() { Random random = new Random(); int index = random.nextInt(array.size()); return array.get(index).val; } } /** * Your Solution object will be instantiated and called as such: * Solution obj = new Solution(head); * int param_1 = obj.getRandom(); */
[LeetCode] 382. Linked List Random Node
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。