当前位置:
首页 >
leetcode 382. Linked List Random Node | 382. 链表随机节点(Java)
发布时间:2024/2/28
37
豆豆
生活随笔
收集整理的这篇文章主要介绍了
leetcode 382. Linked List Random Node | 382. 链表随机节点(Java)
小编觉得挺不错的,现在分享给大家,帮大家做个参考.
题目
https://leetcode.com/problems/linked-list-random-node/
题解
先存起来,再随机返回即可。不知道在考察什么?
/*** Definition for singly-linked list.* public class ListNode {* int val;* ListNode next;* ListNode() {}* ListNode(int val) { this.val = val; }* ListNode(int val, ListNode next) { this.val = val; this.next = next; }* }*/ class Solution {List<Integer> list;java.util.Random rand = new java.util.Random();/** @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) {list = new LinkedList<>();while (head != null) {list.add(head.val);head = head.next;}}/** Returns a random node's value. */public int getRandom() {return list.get(rand.nextInt(list.size()));} } /*** 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 | 382. 链表随机节点(Java)的全部内容,希望文章能够帮你解决所遇到的问题。
- 上一篇: leetcode 385. Mini P
- 下一篇: leetcode 380. Insert