| # | Title | Tag |
|---|---|---|
| 4 | Median of Two Sorted Arrays | Array,Binary Search,Divider and Conquer |
| 10 | Regular Expression Matching | String,Dynamic Programming,Backtracking |
| 17 | Letter Combinations of a Phone Number | String |
| 20 | Valid Parentheses | String,Stack |
| 22 | Generate Parentheses | String,Backtracking |
- EASY
No_617_Merge_Two_Binary_Trees
No_965_Univalued_Binary_Tree
No_700_Search_in_a_Binary_Search_Tree
No_589_N-ary_Tree_Preorder_Traversal
No_590_N-ary_Tree_Postorder_Traversal
No_897_Increasing_Order_Search_Tree
No_872_Leaf_Similar_Trees
No_669_Trim_a_Binary_Search_Tree
No_104_Maximum_Depth_of_Binary_Tree
No_429_N_ary_Tree_Level_Order_Traversal
No_637_Average_of_Levels_in_Binary_Tree
No_226_Invert_Binary_Tree
No_993_Cousins_in_Binary_Tree
No_653_Two_Sum_IV_Input_is_a_BST
No_606_Construct_String_from_Binary_Tree
No_538_Convert_BST_to_Greater_Tree
No_100_Same_Tree
No_108_Convert_Sorted_Array_to_Binary_Search_Tree
No_404_Sum_of_Left_Leaves
No_563_Binary_Tree_Tilt
No_543_Diameter_of_Binary_Tree
No_107_Binary_Tree_Level_Order_Traversal_II
NO_257_Binary_Tree_Paths
No_235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree
No_671_Secon_Minimum_Node_In_a_Binary_Tree
No_101_Symmetric_Tree
No_437_Path_Sum_III ?有点蒙
No_572_Subtree_of_Another_Tree
No_110_Balanced_Binary_Tree
No_501_Find_Mode_in_Binary_Search_Tree
No_111_Minimum_Depth_of_Binary_Tree
No_112_Path_Sum
No_687_Longest_Univalue_Path
No_530_Minimum_Absolute_Difference_in_BST和 783 一样
No_783_Minimum_Distance_Between_BST_Nodes和 530 一样
No_1022_Sum_of_Root_To_Leaf_Binary_Numbers
No_938_Range_Sum_of_BST - MEDIUM
No_654_Maximum_Binary_Tree
No_701_Insert_into_a_Binary_Search_Tree
No_1008_Construct_Binary_Search_Tree_from_Preorder_Traversal
No_814_Binary_Tree_Pruning
No_894_All_Possible_Full_Binary_Trees 重点想 多想想
No_979_Distribute_Coins_in_Binary_Tree 挺有意思的一道题
No_951_Flip_Equivalent_Binary_Trees
No_998_Maximum_Binary_Tree_II
No_889_Construct_Binary_Tree_from_Preorder_and_Postorder_Traversal?有点蒙
No_513_Find_Bottom_Left_Tree_Value
No_515_Find_Largest_Value_in_Each_Tree_Row
No_94_Binary_Tree_Inorder_Traversal
No_865_Smallest_Subtree_with_all_the_Deepest_Nodes
No_508_Most_Frequent_Subtree_Sum
No_655_Print_Binary_Tree
No_144_Binary_Tree_Preorder_Traversal
No_230_Kth_Smallest_Element_in_a_BST
No_988_Smallest_String_Starting_From_Leaf
No_102_Binary_Tree_Level_Order_Traversal
No_337_House_Robber_III
No_199_Binary_Tree_Right_Side_View
No_623_Add_One_Row_to_Tree
No_958_Check_Completeness_of_a_Binary_Tree
No_863_All_Nodes_Distance_K_in_Binary_Tree 重点想 多想想
No_96_Unique_Binary_Search_Trees卡特兰数问题
No_95_Unique_Binary_Search_Trees_II卡特兰数问题
No_652_Find_Duplicate_Subtrees
No_971_Flip_Binary_Tree_To_Match_Preorder_Traversal
No_129_Sum_Root_to_Leaf_Numbers
No_114_Flatten_Binary_Tree_to_Linked_List
No_103_Binary_Tree_Zigzag_Level_Order_Traversal
No_113_Path_Sum_II
No_450_Delete_Node_in_a_BST 有难度的一道
No_105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal 前中序遍历构建树
No_106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal 中序后序遍历构建树
No_98_Validate_Binary_Search_Tree
No_222_Count_Complete_Tree_Nodes这个题好无聊啊...
No_236_Lowest_Common_Ancestor_of_a_Binary_Tree 找祖先的一道题
No_1026_Maximum_Difference_Between_Node_and_Ancestor 找祖先的一道题
No_662_Maximum_Width_of_Binary_Tree
No_987_Vertical_Order_Traversal_of_a_Binary_Tree
No_173_Binary_Search_Tree_Iterator
No_116_Populating_Next_Right_Pointers_in_Each_Node 这个也有点意思
No_117_Populating_Next_Right_Pointers_in_Each_Node_II 这个也有点意思 - HARD
No_99_Recover_Binary_Search_Tree
No_145_Binary_Tree_Postorder_Traversal
No_1028_Recover_a_Tree_From_Preorder_Traversal 有问题
No_124_Binary_Tree_Maximum_Path_Sum
No_1_TwoSum
No_26_RemoveDuplicatesFromSortedArray
No_27_RemoveElement
No_35_SearchInsertPosition
No_88_MergeSortedArray
No_169_Majority_Element
No_268_Missing_Number
No_665_Non_decreasing_Array
No_888_Fair_Candy_Swap
No_977_Squares_Of_A_Sorted_Array
No_905_Sort_Array_By_Parity
No_53_Maximum_Subarray
No_217_Contains_Duplicate
No_219_Contains_Duplicate_II
No_697_Degree_of_an_Array ?没理解
No_724_Find_Pivot_Index
No_118_Pascal_Triangle
No_119_Pascal_Triangle_II
No_121_Best_Time_to_Buy_and_Sell_Stock
No_122_Best_Time_to_Buy_and_Sell_Stock_II
No_283_Move_Zeroes
No_414_Third_Maximum_Number
No_448_Find_All_Numbers_Disappeared_in_an_Array
No_532_K_diff_Pairs_in_an_Array
No_561_Array_Partition_I
No_485_Max_Consecutive_Ones
No_566_Reshape_the_Matrix
No_581_Shortest_Unsorted_Continuous_Subarray
No_4_Median_of_Two_Sorted_Arrays 待解决
No_78_Subsets
No_11_Container_With_Most_Water
No_15_3Sum
No_349_Intersection_of_Two_Arrays
No_16_3Sum_Closest
No_350_Intersection_of_Two_Arrays_II
No_18_4Sum
No_33_Search_in_Rotated_Sorted_Array
No_2_AddTwoNumbers
No_21_MergeTwoSortedLists
No_148_Sort_List 链表排序
No_203_RemoveLinkedListElements
No_206_ReverseLinkedList
No_876_MiddleOfTheLinkedList
No_234_Palindrome_Linked_List
No_19_Remove_Nth_Node_From_End_of_List
No_83_Remove_Duplicates_from_Sorted_List
No_445_AddTwoNumbersII
No_24_Swap_Nodes_in_Pairs ?没理解
No_237_Delete_Node_in_a_LinkedList 没意义的一道题 垃圾
No_160_Intersection_of_Two_Linked_Lists
No_141_Linked_List_Cycle
No_142_Linked_List_Cycle_II
No_92_Reverse_Linked_List_II
No_86_Partition_List
No_109_Convert_Sorted_List_to_Binary_Search_Tree 链表转平衡树
No_61_Rotate_List
No_143_Reorder_List
No_23_Merge_k_Sorted_Lists 已解决 有点难度
No_147_Insertion_Sort_List 插入排序算法问题
No_82_Remove_Duplicates_from_Sorted_List_II
No_25_Reverse_Nodes_in_k_Group待解决
No_725_Split_Linked_List_in_Parts待解决
No_7_ReverseInteger
No_9_PalindromeNumber
No_13_RomanToInteger
No_66_PlusOne
No_12_Integer_to_Roman