2020年12月3日
[LeetCode] 426. Convert Binary Search Tree to Sorted Doubly Linked List
摘要： Convert a Binary Search Tree to a sorted Circular Doubly-Linked List in place. You can think of the left and right pointers as synonymous to the prede 阅读全文
posted @ 2020-12-03 06:50 CNoodle 阅读(247) 评论(0) 推荐(0)
[LeetCode] 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:Wha 阅读全文
posted @ 2020-12-03 02:10 CNoodle 阅读(81) 评论(0) 推荐(0)