分类: LeetCode

文章分类
AcWing 1 C++ 92 Golang 1 数据库 18 LeetCode 280 Linux 19 OpenCV 7 Python 7 数学 2 项目 1 剑指 11 多旋翼 12 CS 24 Math 3 概率论 1 线性代数 2 MySQL 1 STL 1
                            
                            105/106-从先序与中序遍历构造二叉树
                        
                                LeetCode 105. Construct Binary Tree from Preorder and Inorder TraversalLeetCode-105
Given two integer arrays preorder an
                            
                                2021-09-03
                            
                                    LeetCode
                                
                            二叉树
                        
                            513-找树左下角的值
                        
                                LeetCode 513. Find Bottom Left Tree ValueLeetCode-513
Given the root of a binary tree, return the leftmost value in the 
                            
                                2021-07-19
                            
                                    LeetCode
                                
                            二叉树
                        
                            112-路径总和
                        
                                LeetCode 112. Path SumLeetCode-112
Given the root of a binary tree and an integer targetSum, return true if the tree has
                            
                                2021-07-17
                            
                                    LeetCode
                                
                            回溯
                        
                            404-左叶子之和
                        
                                LeetCode 404. Sum of Left LeavesLeetCode-404
Given the root of a binary tree, return the sum of all left leaves.
Example
                            
                                2021-07-15
                            
                                    LeetCode
                                
                            二叉树
                        
                            257-二叉树的所有路径
                        
                                LeetCode 257. Binary Tree PathsLeetCode-257
Given the root of a binary tree, return all root-to-leaf paths in any order.
                            
                                2021-07-14
                            
                                    LeetCode
                                
                            回溯
                        
                            110-平衡二叉树
                        
                                LeetCode 110. Balanced Binary TreeLeetCode-110
Given a binary tree, determine if it is height-balanced.
For this problem
                            
                                2021-07-13
                            
                                    LeetCode
                                
                            二叉树
                        
                            222-完全二叉树的节点
                        
                                222. Count Complete Tree NodesLeetCode-222
Given the root of a complete binary tree, return the number of the nodes in t
                            
                                2021-07-12
                            
                                    LeetCode
                                
                            二叉树
                        
                            104-二叉树的最大深度
                        
                                LeetCode 104. Maximum Depth of Binary TreeLeetCode-104
Given the root of a binary tree, return its maximum depth.
A bina
                            
                                2021-07-11
                            
                                    LeetCode
                                
                            二叉树
                        
                            100/101-对称二叉树
                        
                                LeetCode 100. Same TreeLeetCode-100
Given the roots of two binary trees p and q, write a function to check if they are t
                            
                                2021-07-04
                            
                                    LeetCode
                                
                            二叉树
                        
                            226-翻转二叉树
                        
                                LeetCode 226. Invert Binary TreeLeetCode-226
Given the root of a binary tree, invert the tree, and return its root.
Exam
                            
                                2021-07-03
                            
                                    LeetCode
                                
                            二叉树
                        
                            332-重新安排行程
                        
                                LeetCode 332. Reconstruct ItineraryLeetCode-332
You are given a list of airline tickets where tickets[i] = [from, to] re
                            
                                2021-06-27
                            
                                    LeetCode
                                
                            回溯
                        
                            169-多数元素
                        
                                LeetCode 169. Majority ElementLeetCode-169
Given an array nums of size n, return the majority element.
The majority elem
                            
                                2021-06-27
                            
                                    LeetCode
                                
                            哈希表