leetcode
文章平均质量分 50
errly_liu2828
男猫,敲代码的猫,学习C语言中,渴望得到力量
展开
-
leetcode——145. Binary Tree Postorder Traversal
描述Given the root of a binary tree, return the postorder traversal of its nodes’ values.Example 1:Input: root = [1,null,2,3]Output: [3,2,1]Example 2:Input: root = []Output: []Example 3:Input: root = [1]Output: [1]递归/** * Definition for a原创 2021-09-17 20:11:09 · 165 阅读 · 0 评论 -
leetcode——94. Binary Tree Inorder Traversal
描述Given the root of a binary tree, return the inorder traversal of its nodes’ values.Example 1:Input: root = [1,null,2,3]Output: [1,3,2]Example 2:Input: root = []Output: []Example 3:Input: root = [1]Output: [1]递归/** * Definition for a b原创 2021-09-17 19:48:33 · 176 阅读 · 0 评论 -
leetcode——144. Binary Tree Preorder Traversal
描述Given the root of a binary tree, return the preorder traversal of its nodes’ values.Example 1:Input: root = [1,null,2,3]Output: [1,2,3]Example 2:Input: root = []Output: []Example 3:Input: root = [1]Output: [1]递归/** * Definition for a原创 2021-09-16 20:43:06 · 134 阅读 · 0 评论 -
leetcode——65. Valid Number
A valid number can be split up into these components (in order):A decimal number or an integer.(Optional) An ‘e’ or ‘E’, followed by an integer.A decimal number can be split up into these components (in order):(Optional) A sign character (either ‘+’原创 2021-08-31 15:28:47 · 196 阅读 · 0 评论 -
leetcode——138. Copy List with Random Pointer
描述A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.Construct a deep copy of the list. The deep copy should consist of exactly n brand new nodes, where each ne原创 2021-08-28 12:12:45 · 101 阅读 · 0 评论 -
leetcode——82. Remove Duplicates from Sorted List II
描述Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well.Input: head = [1,2,3,3,4,4,5]Output: [1,2,5]Input: head = [1,1,1,2,原创 2021-08-26 13:51:11 · 82 阅读 · 0 评论