分类: leetcode | 倪春恩的博客

倪春恩的博客

文章分类

leetcode 464 bigdata 1 默认 1 设计模式 22 其他 1 SQL 1 大数据 1

                            
                            lc-114
                        
                                /**
Given the root of a binary tree, flatten the tree into a "linked list": 

 The "linked list" should use the same T
                            
                                2022-08-23
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-105
                        
                                /**
Given two integer arrays preorder and inorder where preorder is the preorder 
traversal of a binary tree and inorder
                            
                                2022-08-22
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-104
                        
                                Given the root of a binary tree, return its maximum depth.
A binary tree’s maximum depth is the number of nodes along th
                            
                                2022-08-18
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-102
                        
                                Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level
                            
                                2022-08-17
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-101
                        
                                //Given the root of a binary tree, check whether it is a mirror of itself (i.e.,
// symmetric around its center). 
//
//
                            
                                2022-08-16
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-98
                        
                                //Given the root of a binary tree, determine if it is a valid binary search tree
// (BST). 
//
// A valid BST is defined
                            
                                2022-08-15
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-94
                        
                                //Given the root of a binary tree, return the inorder traversal of its nodes' va
//lues. 
//
// 
// Example 1: 
//
// 
/
                            
                                2022-08-12
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-91
                        
                                //A message containing letters from A-Z can be encoded into numbers using the fo
//llowing mapping: 
//
// 
//'A' -> 
                            
                                2022-08-11
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-88
                        
                                //You are given two integer arrays nums1 and nums2, sorted in non-decreasing ord
//er, and two integers m and n, represe
                            
                                2022-08-10
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-84
                        
                                //Given an array of integers heights representing the histogram's bar height whe
//re the width of each bar is 1, return
                            
                                2022-08-09
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-79
                        
                                //Given an m x n grid of characters board and a string word, return true if word
// exists in the grid. 
//
// The word 
                            
                                2022-08-08
                            
                                    leetcode
                                
                            leetcode
                        
                            lc-78
                        
                                //Given an integer array nums of unique elements, return all possible subsets (t
//he power set). 
//
// The solution se
                            
                                2022-08-05
                            
                                    leetcode
                                
                            leetcode

            
36 / 39