https://github.com/bighuang624/leetcode-everyday
每天一题 LeetCode | workin' everyday~Hustle everyday~LeetCode everyday~yuh yuh yuh
https://github.com/bighuang624/leetcode-everyday
leetcode
Last synced: 2 months ago
JSON representation
每天一题 LeetCode | workin' everyday~Hustle everyday~LeetCode everyday~yuh yuh yuh
- Host: GitHub
- URL: https://github.com/bighuang624/leetcode-everyday
- Owner: bighuang624
- Created: 2017-09-16T14:58:47.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2018-10-09T10:12:15.000Z (almost 7 years ago)
- Last Synced: 2025-04-19T13:44:38.178Z (3 months ago)
- Topics: leetcode
- Language: Java
- Homepage:
- Size: 611 KB
- Stars: 13
- Watchers: 1
- Forks: 6
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 每天一题 LeetCode
[](http://kyonhuang.top)
## 步骤
1. 看题
2. 思考
3. 做题
4. 优化(提高效率、简洁代码)
5. 换语言实现(为了准备机试,暂时跳过这一步,全由 Java 实现)
6. 看 Discuss
7. 整理总结## notes
* [1.Two_Sum](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/1.Two_Sum.md)
* [100.Same_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/100.Same_Tree.md)
* [101.Symmetric_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/101.Symmetric_Tree.md)
* [102.Binary_Tree_Level_Order_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/102.Binary_Tree_Level_Order_Traversal.md)
* [103.Binary_Tree_Zigzag_Level_Order_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/103.Binary_Tree_Zigzag_Level_Order_Traversal.md)
* [104.Maximum_Depth_of_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/104.Maximum_Depth_of_Binary_Tree.md)
* [107.Binary_Tree_Level_Order_Traversal_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/107.Binary_Tree_Level_Order_Traversal_II.md)
* [108.Convert_Sorted_Array_to_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/108.Convert_Sorted_Array_to_Binary_Search_Tree.md)
* [109.Convert_Sorted_List_to_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/109.Convert_Sorted_List_to_Binary_Search_Tree.md)
* [11.Container_With_Most_Water](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/11.Container_With_Most_Water.md)
* [110.Balanced_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/110.Balanced_Binary_Tree.md)
* [111.Minimum_Depth_of_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/111.Minimum_Depth_of_Binary_Tree.md)
* [112.Path_Sum](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/112.Path_Sum.md)
* [113.Path_Sum_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/113.Path_Sum_II.md)
* [116.Populating_Next_Right_Pointers_in_Each_Node](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/116.Populating_Next_Right_Pointers_in_Each_Node.md)
* [118.Pascal's_Triangle](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/118.Pascal's_Triangle.md)
* [119.Pascal's_Triangle_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/119.Pascal's_Triangle_II.md)
* [121.Best_Time_to_Buy_and_Sell_Stock](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/121.Best_Time_to_Buy_and_Sell_Stock.md)
* [122.Best_Time_to_Buy_and_Sell_Stock_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/122.Best_Time_to_Buy_and_Sell_Stock_II.md)
* [129.Sum_Root_to_Leaf_Numbers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/129.Sum_Root_to_Leaf_Numbers.md)
* [133.Clone_Graph](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/133.Clone_Graph.md)
* [135.Candy](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/135.Candy.md)
* [136.Single_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/136.Single_Number.md)
* [137.Single_Number_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/137.Single_Number_II.md)
* [138.Copy_List_with_Random_Pointer](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/138.Copy_List_with_Random_Pointer.md)
* [139.Word_Break](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/139.Word_Break.md)
* [14.Longest_Common_Prefix](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/14.Longest_Common_Prefix.md)
* [141.Linked_List_Cycle](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/141.Linked_List_Cycle.md)
* [142.Linked_List_Cycle_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/142.Linked_List_Cycle_II.md)
* [143.Reorder_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/143.Reorder_List.md)
* [144.Binary_Tree_Preorder_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/144.Binary_Tree_Preorder_Traversal.md)
* [15.3Sum](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/15.3Sum.md)
* [151.Reverse_Words_in_a_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/151.Reverse_Words_in_a_String.md)
* [152.Maximum_Product_Subarray](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/152.Maximum_Product_Subarray.md)
* [153.Find_Minimum_in_Rotated_Sorted_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/153.Find_Minimum_in_Rotated_Sorted_Array.md)
* [155.Min_Stack](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/155.Min_Stack.md)
* [160.Intersection_of_Two_Linked_Lists](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/160.Intersection_of_Two_Linked_Lists.md)
* [162.Find_Peak_Element](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/162.Find_Peak_Element.md)
* [165.Compare_Version_Numbers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/165.Compare_Version_Numbers.md)
* [167.Two_Sum_II_-_Input_array_is_sorted](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/167.Two_Sum_II_-_Input_array_is_sorted.md)
* [169.Majority_Element](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/169.Majority_Element.md)
* [17.Letter_Combinations_of_a_Phone_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/17.Letter_Combinations_of_a_Phone_Number.md)
* [172.Factorial_Trailing_Zeroes](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/172.Factorial_Trailing_Zeroes.md)
* [173.Binary_Search_Tree_Iterator](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/173.Binary_Search_Tree_Iterator.md)
* [179.Largest_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/179.Largest_Number.md)
* [181.Employees_Earning_More_Than_Their_Managers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/181.Employees_Earning_More_Than_Their_Managers.md)
* [183.Customers_Who_Never_Order](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/183.Customers_Who_Never_Order.md)
* [187.Repeated_DNA_Sequences](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/187.Repeated_DNA_Sequences.md)
* [189.Rotate_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/189.Rotate_Array.md)
* [19.Remove_Nth_Node_From_End_of_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/19.Remove_Nth_Node_From_End_of_List.md)
* [191.Number_of_1_Bits](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/191.Number_of_1_Bits.md)
* [198.House_Robber](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/198.House_Robber.md)
* [199.Binary_Tree_Right_Side_View](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/199.Binary_Tree_Right_Side_View.md)
* [2.Add_Two_Numbers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/2.Add_Two_Numbers.md)
* [20.Valid_Parentheses](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/20.Valid_Parentheses.md)
* [200.Number_of_Islands](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/200.Number_of_Islands.md)
* [202.Happy_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/202.Happy_Number.md)
* [203.Remove_Linked_List_Elements](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/203.Remove_Linked_List_Elements.md)
* [205.Isomorphic_Strings](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/205.Isomorphic_Strings.md)
* [206.Reverse_Linked_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/206.Reverse_Linked_List.md)
* [207.Course_Schedule](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/207.Course_Schedule.md)
* [209.Minimum_Size_Subarray_Sum](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/209.Minimum_Size_Subarray_Sum.md)
* [21.Merge_Two_Sorted_Lists](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/21.Merge_Two_Sorted_Lists.md)
* [215.Kth_Largest_Element_in_an_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/215.Kth_Largest_Element_in_an_Array.md)
* [217.Contains_Duplicate](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/217.Contains_Duplicate.md)
* [219.Contains_Duplicate_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/219.Contains_Duplicate_II.md)
* [223.Rectangle_Area](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/223.Rectangle_Area.md)
* [225.Implement_Stack_using_Queues](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/225.Implement_Stack_using_Queues.md)
* [226.Invert_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/226.Invert_Binary_Tree.md)
* [230.Kth_Smallest_Element_in_a_BST](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/230.Kth_Smallest_Element_in_a_BST.md)
* [231.Power_of_Two](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/231.Power_of_Two.md)
* [232.Implement_Queue_using_Stacks](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/232.Implement_Queue_using_Stacks.md)
* [234.Palindrome_Linked_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/234.Palindrome_Linked_List.md)
* [237.Delete_Node_in_a_Linked_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/237.Delete_Node_in_a_Linked_List.md)
* [238.Product_of_Array_Except_Self](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/238.Product_of_Array_Except_Self.md)
* [24.Swap_Nodes_in_Pairs](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/24.Swap_Nodes_in_Pairs.md)
* [242.Valid_Anagram](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/242.Valid_Anagram.md)
* [257.Binary_Tree_Paths](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/257.Binary_Tree_Paths.md)
* [258.Add_Digits](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/258.Add_Digits.md)
* [26.Remove_Duplicates_from_Sorted_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/26.Remove_Duplicates_from_Sorted_Array.md)
* [260.Single_Number_III](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/260.Single_Number_III.md)
* [263.Ugly_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/263.Ugly_Number.md)
* [264.Ugly_Number_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/264.Ugly_Number_II.md)
* [268.Missing_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/268.Missing_Number.md)
* [27.Remove_Element](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/27.Remove_Element.md)
* [274.H-Index](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/274.H-Index.md)
* [275.H-Index_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/275.H-Index_II.md)
* [278.First_Bad_Version](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/278.First_Bad_Version.md)
* [279.Perfect_Squares](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/279.Perfect_Squares.md)
* [28.Implement_strStr()](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/28.Implement_strStr().md)
* [283.Move_Zeroes](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/283.Move_Zeroes.md)
* [287.Find_the_Duplicate_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/287.Find_the_Duplicate_Number.md)
* [290.Word_Pattern](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/290.Word_Pattern.md)
* [292.Nim_Game](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/292.Nim_Game.md)
* [3.Longest_Substring_Without_Repeating_Characters](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/3.Longest_Substring_Without_Repeating_Characters.md)
* [300.Longest_Increasing_Subsequence](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/300.Longest_Increasing_Subsequence.md)
* [303.Range_Sum_Query-Immutable](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/303.Range_Sum_Query-Immutable.md)
* [31.Next_Permutation](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/31.Next_Permutation.md)
* [319.Bulb_Switcher](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/319.Bulb_Switcher.md)
* [32.Longest_Valid_Parentheses](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/32.Longest_Valid_Parentheses.md)
* [326.Power_of_Three](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/326.Power_of_Three.md)
* [328.Odd_Even_Linked_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/328.Odd_Even_Linked_List.md)
* [33.Search_in_Rotated_Sorted_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/33.Search_in_Rotated_Sorted_Array.md)
* [34.Search_for_a_Range](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/34.Search_for_a_Range.md)
* [342.Power_of_Four](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/342.Power_of_Four.md)
* [343.Integer_Break](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/343.Integer_Break.md)
* [344.Reverse_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/344.Reverse_String.md)
* [345.Reverse_Vowels_of_a_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/345.Reverse_Vowels_of_a_String.md)
* [347.Top_K_Frequent_Elements](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/347.Top_K_Frequent_Elements.md)
* [349.Intersection_of_Two_Arrays](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/349.Intersection_of_Two_Arrays.md)
* [35.Search_Insert_Position](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/35.Search_Insert_Position.md)
* [350.Intersection_of_Two_Arrays_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/350.Intersection_of_Two_Arrays_II.md)
* [36.Valid_Sudoku](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/36.Valid_Sudoku.md)
* [367.Valid_Perfect_Square](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/367.Valid_Perfect_Square.md)
* [374.Guess_Number_Higher_or_Lower](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/374.Guess_Number_Higher_or_Lower.md)
* [375.Guess_Number_Higher_or_Lower_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/375.Guess_Number_Higher_or_Lower_II.md)
* [378.Kth_Smallest_Element_in_a_Sorted_Matrix](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/378.Kth_Smallest_Element_in_a_Sorted_Matrix.md)
* [38.Count_and_Say](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/38.Count_and_Say.md)
* [382.Linked_List_Random_Node](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/382.Linked_List_Random_Node.md)
* [383.Ransom_Note](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/383.Ransom_Note.md)
* [384.Shuffle_an_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/384.Shuffle_an_Array.md)
* [387.First_Unique_Character_in_a_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/387.First_Unique_Character_in_a_String.md)
* [389.Find_the_Difference](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/389.Find_the_Difference.md)
* [392.Is_Subsequence](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/392.Is_Subsequence.md)
* [398.Random_Pick_Index](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/398.Random_Pick_Index.md)
* [400.Nth_Digit](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/400.Nth_Digit.md)
* [404.Sum_of_Left_Leaves](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/404.Sum_of_Left_Leaves.md)
* [409.Longest_Palindrome](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/409.Longest_Palindrome.md)
* [412.Fizz_Buzz](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/412.Fizz_Buzz.md)
* [413.Arithmetic_Slices](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/413.Arithmetic_Slices.md)
* [414.Third_Maximum_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/414.Third_Maximum_Number.md)
* [415.Add_Strings](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/415.Add_Strings.md)
* [419.Battleships_in_a_Board](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/419.Battleships_in_a_Board.md)
* [429.N-ary_Tree_Level_Order_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/429.N-ary_Tree_Level_Order_Traversal.md)
* [434.Number_of_Segments_in_a_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/434.Number_of_Segments_in_a_String.md)
* [438.Find_All_Anagrams_in_a_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/438.Find_All_Anagrams_in_a_String.md)
* [441.Arranging_Coins](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/441.Arranging_Coins.md)
* [442.Find_All_Duplicates_in_an_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/442.Find_All_Duplicates_in_an_Array.md)
* [443.String_Compression](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/443.String_Compression.md)
* [448.Find_All_Numbers_Disappeared_in_an_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/448.Find_All_Numbers_Disappeared_in_an_Array.md)
* [451.Sort_Characters_By_Frequency](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/451.Sort_Characters_By_Frequency.md)
* [453.Minimum_Moves_to_Equal_Array_Elements](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/453.Minimum_Moves_to_Equal_Array_Elements.md)
* [455.Assign_Cookies](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/455.Assign_Cookies.md)
* [459.Repeated_Substring_Pattern](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/459.Repeated_Substring_Pattern.md)
* [46.Permutations](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/46.Permutations.md)
* [461.Hamming_Distance](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/461.Hamming_Distance.md)
* [462.Minimum_Moves_to_Equal_Array_Elements_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/462.Minimum_Moves_to_Equal_Array_Elements_II.md)
* [463.Island_Perimeter](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/463.Island_Perimeter.md)
* [476.Number_Complement](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/476.Number_Complement.md)
* [482.License_Key_Formatting](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/482.License_Key_Formatting.md)
* [485.Max_Consecutive_Ones](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/485.Max_Consecutive_Ones.md)
* [492.Construct_the_Rectangle](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/492.Construct_the_Rectangle.md)
* [495.Teemo_Attacking](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/495.Teemo_Attacking.md)
* [496.Next_Greater_Element_I](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/496.Next_Greater_Element_I.md)
* [50.Pow(x,n)](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/50.Pow(x,n).md)
* [500.Keyboard_Row](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/500.Keyboard_Row.md)
* [501.Find_Mode_in_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/501.Find_Mode_in_Binary_Search_Tree.md)
* [503.Next_Greater_Element_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/503.Next_Greater_Element_II.md)
* [506.Relative_Ranks](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/506.Relative_Ranks.md)
* [507.Perfect_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/507.Perfect_Number.md)
* [508.Most_Frequent_Subtree_Sum](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/508.Most_Frequent_Subtree_Sum.md)
* [513.Find_Bottom_Left_Tree_Value](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/513.Find_Bottom_Left_Tree_Value.md)
* [515.Find_Largest_Value_in_Each_Tree_Row](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/515.Find_Largest_Value_in_Each_Tree_Row.md)
* [520.Detect_Capital](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/520.Detect_Capital.md)
* [521.Longest_Uncommon_Subsequence_I](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/521.Longest_Uncommon_Subsequence_I.md)
* [525.Contiguous_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/525.Contiguous_Array.md)
* [53.Maximum_Subarray](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/53.Maximum_Subarray.md)
* [530.Minimum_Absolute_Difference_in_BST](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/530.Minimum_Absolute_Difference_in_BST.md)
* [532.K-diff_Pairs_in_an_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/532.K-diff_Pairs_in_an_Array.md)
* [537.Complex_Number_Multiplication](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/537.Complex_Number_Multiplication.md)
* [538.Convert_BST_to_Greater_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/538.Convert_BST_to_Greater_Tree.md)
* [539.Minimum_Time_Difference](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/539.Minimum_Time_Difference.md)
* [54.Spiral_Matrix](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/54.Spiral_Matrix.md)
* [540.Single_Element_in_a_Sorted_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/540.Single_Element_in_a_Sorted_Array.md)
* [541.Reverse_String_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/541.Reverse_String_II.md)
* [543.Diameter_of_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/543.Diameter_of_Binary_Tree.md)
* [547.Friend_Circles](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/547.Friend_Circles.md)
* [551.Student_Attendance_Record_I](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/551.Student_Attendance_Record_I.md)
* [553.Optimal_Division](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/553.Optimal_Division.md)
* [554.Brick_Wall](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/554.Brick_Wall.md)
* [557.Reverse_Words_in_a_String_III](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/557.Reverse_Words_in_a_String_III.md)
* [561.Array_Partition_I](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/561.Array_Partition_I.md)
* [563.Binary_Tree_Tilt](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/563.Binary_Tree_Tilt.md)
* [566.Reshape_the_Matrix](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/566.Reshape_the_Matrix.md)
* [572.Subtree_of_Another_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/572.Subtree_of_Another_Tree.md)
* [575.Distribute_Candies](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/575.Distribute_Candies.md)
* [58.Length_of_Last_Word](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/58.Length_of_Last_Word.md)
* [581.Shortest_Unsorted_Continuous_Subarray](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/581.Shortest_Unsorted_Continuous_Subarray.md)
* [589.N-ary_Tree_Preorder_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/589.N-ary_Tree_Preorder_Traversal.md)
* [590.N-ary_Tree_Postorder_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/590.N-ary_Tree_Postorder_Traversal.md)
* [594.Longest_Harmonious_Subsequence](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/594.Longest_Harmonious_Subsequence.md)
* [595.Big_Countries](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/595.Big_Countries.md)
* [596.Classes_More_Than_5_Students](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/596.Classes_More_Than_5_Students.md)
* [598.Range_Addition_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/598.Range_Addition_II.md)
* [599.Minimum_Index_Sum_of_Two_Lists](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/599.Minimum_Index_Sum_of_Two_Lists.md)
* [6.ZigZag_Conversion](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/6.ZigZag_Conversion.md)
* [605.Can_Place_Flowers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/605.Can_Place_Flowers.md)
* [606.Construct_String_from_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/606.Construct_String_from_Binary_Tree.md)
* [61.Rotate_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/61.Rotate_List.md)
* [617.Merge_Two_Binary_Trees](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/617.Merge_Two_Binary_Trees.md)
* [62.Unique_Paths](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/62.Unique_Paths.md)
* [620.Not_Boring_Movies](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/620.Not_Boring_Movies.md)
* [623.Add_One_Row_to_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/623.Add_One_Row_to_Tree.md)
* [628.Maximum_Product_of_Three_Numbers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/628.Maximum_Product_of_Three_Numbers.md)
* [633.Sum_of_Square_Numbers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/633.Sum_of_Square_Numbers.md)
* [637.Average_of_Levels_in_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/637.Average_of_Levels_in_Binary_Tree.md)
* [643.Maximum_Average_Subarray_I](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/643.Maximum_Average_Subarray_I.md)
* [645.Set_Mismatch](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/645.Set_Mismatch.md)
* [646.Maximum_Length_of_Pair_Chain](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/646.Maximum_Length_of_Pair_Chain.md)
* [647.Palindromic_Substrings](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/647.Palindromic_Substrings.md)
* [653.Two_Sum_IV-Input_is_a_BST](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/653.Two_Sum_IV-Input_is_a_BST.md)
* [654.Maximum_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/654.Maximum_Binary_Tree.md)
* [657.Judge_Route_Circle](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/657.Judge_Route_Circle.md)
* [66.Plus_One](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/66.Plus_One.md)
* [661.Image_Smoother](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/661.Image_Smoother.md)
* [662.Maximum_Width_of_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/662.Maximum_Width_of_Binary_Tree.md)
* [665.Non-decreasing_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/665.Non-decreasing_Array.md)
* [669.Trim_a_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/669.Trim_a_Binary_Search_Tree.md)
* [67.Add_Binary](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/67.Add_Binary.md)
* [671.Second_Minimum_Node_In_a_Binary_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/671.Second_Minimum_Node_In_a_Binary_Tree.md)
* [672.Bulb_Switcher_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/672.Bulb_Switcher_II.md)
* [674.Longest_Continuous_Increasing_Subsequence](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/674.Longest_Continuous_Increasing_Subsequence.md)
* [676.Implement_Magic_Dictionary](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/676.Implement_Magic_Dictionary.md)
* [677.Map_Sum_Pairs](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/677.Map_Sum_Pairs.md)
* [680.Valid_Palindrome_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/680.Valid_Palindrome_II.md)
* [684.Redundant_Connection](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/684.Redundant_Connection.md)
* [686.Repeated_String_Match](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/686.Repeated_String_Match.md)
* [687.Longest_Univalue_Path](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/687.Longest_Univalue_Path.md)
* [69.Sqrt(x)](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/69.Sqrt(x).md)
* [690.Employee_Importance](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/690.Employee_Importance.md)
* [693.Binary_Number_with_Alternating_Bits](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/693.Binary_Number_with_Alternating_Bits.md)
* [695.Max_Area_of_Island](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/695.Max_Area_of_Island.md)
* [697.Degree_of_an_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/697.Degree_of_an_Array.md)
* [7.Reverse_Integer](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/7.Reverse_Integer.md)
* [70.Climbing_Stairs](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/70.Climbing_Stairs.md)
* [700.Search_in_a_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/700.Search_in_a_Binary_Search_Tree.md)
* [701.Insert_into_a_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/701.Insert_into_a_Binary_Search_Tree.md)
* [704.Binary_Search](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/704.Binary_Search.md)
* [709.To_Lower_Case](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/709.To_Lower_Case.md)
* [717.1-bit_and_2-bit_Characters](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/717.1-bit_and_2-bit_Characters.md)
* [720.Longest_Word_in_Dictionary](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/720.Longest_Word_in_Dictionary.md)
* [724.Find_Pivot_Index](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/724.Find_Pivot_Index.md)
* [725.Split_Linked_List_in_Parts](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/725.Split_Linked_List_in_Parts.md)
* [728.Self_Dividing_Numbers](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/728.Self_Dividing_Numbers.md)
* [733.Flood_Fill](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/733.Flood_Fill.md)
* [734.Sentence_Similarity](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/734.Sentence_Similarity.md)
* [739.Daily_Temperatures](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/739.Daily_Temperatures.md)
* [74.Search_a_2D_Matrix](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/74.Search_a_2D_Matrix.md)
* [744.Find_Smallest_Letter_Greater_Than_Target](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/744.Find_Smallest_Letter_Greater_Than_Target.md)
* [746.Min_Cost_Climbing_Stairs](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/746.Min_Cost_Climbing_Stairs.md)
* [747.Largest_Number_At_Least_Twice_of_Others](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/747.Largest_Number_At_Least_Twice_of_Others.md)
* [75.Sort_Colors](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/75.Sort_Colors.md)
* [754.Reach_a_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/754.Reach_a_Number.md)
* [760.Find_Anagram_Mappings](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/760.Find_Anagram_Mappings.md)
* [763.Partition_Labels](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/763.Partition_Labels.md)
* [769.Max_Chunks_To_Make_Sorted](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/769.Max_Chunks_To_Make_Sorted.md)
* [771.Jewels_and_Stones](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/771.Jewels_and_Stones.md)
* [78.Subsets](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/78.Subsets.md)
* [781.Rabbits_in_Forest](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/781.Rabbits_in_Forest.md)
* [783.Minimum_Distance_Between_BST_Nodes](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/783.Minimum_Distance_Between_BST_Nodes.md)
* [784.Letter_Case_Permutation](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/784.Letter_Case_Permutation.md)
* [788.Rotated_Digits](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/788.Rotated_Digits.md)
* [79.Word_Search](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/79.Word_Search.md)
* [791.Custom_Sort_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/791.Custom_Sort_String.md)
* [796.Rotate_String](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/796.Rotate_String.md)
* [797.All_Paths_From_Source_to_Target](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/797.All_Paths_From_Source_to_Target.md)
* [80.Remove_Duplicates_from_Sorted_Array_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/80.Remove_Duplicates_from_Sorted_Array_II.md)
* [804.Unique_Morse_Code_Words](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/804.Unique_Morse_Code_Words.md)
* [807.Max_Increase_to_Keep_City_Skyline](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/807.Max_Increase_to_Keep_City_Skyline.md)
* [811.Subdomain_Visit_Count](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/811.Subdomain_Visit_Count.md)
* [812.Largest_Triangle_Area](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/812.Largest_Triangle_Area.md)
* [814.Binary_Tree_Pruning](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/814.Binary_Tree_Pruning.md)
* [817.Linked_List_Components](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/817.Linked_List_Components.md)
* [82.Remove_Duplicates_from_Sorted_List_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/82.Remove_Duplicates_from_Sorted_List_II.md)
* [821.Shortest_Distance_to_a_Character](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/821.Shortest_Distance_to_a_Character.md)
* [83.Remove_Duplicates_from_Sorted_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/83.Remove_Duplicates_from_Sorted_List.md)
* [840.Magic_Squares_In_Grid](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/840.Magic_Squares_In_Grid.md)
* [841.Keys_and_Rooms](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/841.Keys_and_Rooms.md)
* [849.Maximize_Distance_to_Closest_Person](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/849.Maximize_Distance_to_Closest_Person.md)
* [86.Partition_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/86.Partition_List.md)
* [860.Lemonade_Change](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/860.Lemonade_Change.md)
* [861.Score_After_Flipping_Matrix](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/861.Score_After_Flipping_Matrix.md)
* [872.Leaf-Similar_Trees](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/872.Leaf-Similar_Trees.md)
* [876.Middle_of_the_Linked_List](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/876.Middle_of_the_Linked_List.md)
* [88.Merge_Sorted_Array](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/88.Merge_Sorted_Array.md)
* [9.Palindrome_Number](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/9.Palindrome_Number.md)
* [92.Reverse_Linked_List_II](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/92.Reverse_Linked_List_II.md)
* [94.Binary_Tree_Inorder_Traversal](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/94.Binary_Tree_Inorder_Traversal.md)
* [96.Unique_Binary_Search_Trees](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/96.Unique_Binary_Search_Trees.md)
* [98.Validate_Binary_Search_Tree](https://github.com/bighuang624/LeetCode-everyday/blob/master/notes/98.Validate_Binary_Search_Tree.md)## 代码目录
相关代码详见[代码目录](https://github.com/bighuang624/LeetCode-everyday/blob/master/code)
## 维护
本文档由 [yuki](https://github.com/bighuang624/yuki) 维护
## LICENSE
本项目所有文章采用 [CC BY-NC-SA 3.0](https://creativecommons.org/licenses/by-nc-sa/3.0/) 许可协议。转载请注明出处!