2020-09-27 21:17:10

docs/leetcode/cpp/README.md

@@ -1 +1 @@
-# Leetcode solutions and summary!
+# Leetcode C++ 题解

docs/leetcode/cpp/SUMMARY.md

@@ -0,0 +1,158 @@
++   [Leetcode C++ 题解](README.md)
++   [1. Two Sum](0001._Two_Sum.md)
++   [2. Add Two Numbers](0002._Add_Two_Numbers.md)
++   [3. Longest Substring Without Repeating Characters](0003._Longest_Substring_Without_Repeating_Characters.md)
++   [004. Median of Two Sorted Arrays](0004._Median_of_Two_Sorted_Arrays.md)
++   [5. Longest Palindromic Substring](0005._Longest_Palindromic_Substring.md)
++   [6. ZigZag Conversion](0006._ZigZag _Conversion.md)
++   [7. Reverse Integer](0007._Reverse_Integer.md)
++   [8. String to Integer (atoi)](0008._String_to_Integer_(atoi).md)
++   [9. Palindrome Number](0009._Palindrome_Number.md)
++   [10. Regular Expression Matching](0010._Regular_Expression_Matching.md)
++   [11. container with most water](0011._Container_With_Most_Water.md)
++   [12. Integer to Roman](0012._Integer_to_Roman.md)
++   [14. Longest Common Prefix](0014._Longest_Common_Prefix.md)
++   [15. 3sum](0015._3sum.md)
++   [16. 3Sum Closest](0016._3Sum_Closest.md)
++   [17. Letter Combinations of a Phone Number](0017._Letter_Combinations_of_a_Phone_Number.md)
++   [18. 4Sum](0018._4Sum.md)
++   [19. Remove Nth Node From End of List](0019._Remove_Nth_Node_From_End_of_List.md)
++   [20. Valid Parentheses](0020._Valid_Parentheses.md)
++   [21. Merge Two Sorted Lists](0021._Merge _Two _Sorted _Lists.md)
++   [22. Generate Parentheses](0022._Generate_Parentheses.md)
++   [23. merge k sorted lists](0023._Merge_K_Sorted_Lists.md)
++   [24. Swap Nodes in Pairs](0024._Swap_Nodes_in_Pairs.md)
++   [25.reverse nodes in k group](0025._Reverse_Nodes_In_K_Group.md)
++   [26.Remove Duplicates From Sorted Array](0026._Remove_Duplicates_From_Sorted_Array.md)
++   [27.Remove Element](0027._Remove_Element.md)
++   [28.implement strstr](0028._Implement_Strstr.md)
++   [29.divide two integers](0029._Divide_Two_Integers.md)
++   [30.substring with concatenation of all words](0030._Substring_With_Concatenation_Of_All_Words.md)
++   [31.Next Permutatio](0031._Next_Permutatio.md)
++   [32. Longest Valid Parentheses](0032._Longest_Valid_Parentheses.md)
++   [033. Search in Rotated Sorted Array](0033._Search_in_Rotated_Sorted_Array.md)
++   [34. Find First and Last Position of Element in Sorted Array](0034._Find_First_and_Last_Position_of_Element_in_Sorted_Array.md)
++   [ˢ������](0035._Search_Insert_Position.md)
++   [36. Valid Sudoku](0036._Valid_Sudoku.md)
++   [38. Count and Say](0038._Count_and_Say.md)
++   [39. Combination Sum](0039._Combination_Sum.md)
++   [40. Combination Sum II](0040._Combination_Sum_II.md)
++   [041.First Missing Positive](0041._First_Missing_Positive.md)
++   [42. Trapping Rain Water](0042._Trapping_Rain_Water.md)
++   [43. Multiply Strings](0043._Multiply_Strings.md)
++   [44. Wildcard Matching](0044._Wildcard_Matching.md)
++   [045. Jump Game II](0045._Jump_Game_II.md)
++   [46. Permutations](0046._Permutations.md)
++   [47. Permutations II](0047._Permutations_II.md)
++   [49. Group Anagrams](0048._Rotate_Image.md)
++   [49. Group Anagrams](0049._Group_Anagrams.md)
++   [50. powx n](0050._powx_n.md)
++   [51. N-Queens](0051._ N-Queens.md)
++   [52. N-Queens II](0052._N-Queens_II.md)
++   [053. Maximum Subarray](0053._Maximum_Subarray.md)
++   [54. Spiral Matrix](0054._Spiral_Matrix.md)
++   [55. Jump Game](0055._Jump_Game.md)
++   [56. Merge Intervals](0056._Merge_Intervals.md)
++   [57. Insert Interval](0057._Insert_Interval.md)
++   [058. Length of Last Word](0058._Length_of_Last_Word.md)
++   [59. Spiral Matrix II](0059._Spiral_Matrix_II.md)
++   [60. Permutation Sequence](0060._Permutation_Sequence.md)
++   [61. Rotate List](0061._Rotate_List.md)
++   [62. Unique Paths](0062._Unique_Paths.md)
++   [63. Unique Paths II](0063._Unique_Paths_II.md)
++   [64. Minimum Path Sum](0064._Minimum_Path_Sum.md)
++   [65. Valid Number](0065._Valid_Number.md)
++   [66. Plus One](0066._Plus_One.md)
++   [68. Text Justification](0068._Text_Justification.md)
++   [69. Sqrt(x)](0069._Sqr(x).md)
++   [72. Edit Distance](0072._Edit_Distance.md)
++   [75. Sort Colors](0075._Sort_Colors.md)
++   [76. Minimum Window Substring](0076._Minimum_Window_Substring.md)
++   [77. Combinations](0077._combinations.md)
++   [78. Subsets](0078._subsets.md)
++   [81. Search in Rotated Sorted Array II](0081._Search_in_Rotated_Sorted_Array_II.md)
++   [ˢ������](0083._Remove_Duplicates_From_Sorted_Lists.md)
++   [84. Largest Rectangle in Histogram](0084._Largest_Rectangle_in_Histogram.md)
++   [85. Maximal Rectangle](0085._Maximal_Rectangle.md)
++   [87. Scramble String](0087._Scramble_String.md)
++   [88.Merge Sorted Array](0088._Merge_Sorted_Array.md)
++   [90. Subsets II](0090._Subsets_II.md)
++   [94. Binary Tree Inorder Traversal](0094._binary_tree_inorder_traversal.md)
++   [96. Unique Binary Search Trees](0096._Unique_Binary_Search_Trees.md)
++   [97. Interleaving String](0097._Interleaving_String.md)
++   [99. Recover Binary Search Tree](0099._Recover_Binary_Search_Tree.md)
++   [100. same tree](0100._same_tree.md)
++   [101. Symmetric Tree](0101._Symmetric_Tree.md)
++   [102. Binary Tree Level Order Traversal](0102._Binary_Tree_Level_Order_Traversal.md)
++   [104. Maximum Depth of Binary Tree](0104._Maximum_Depth_of_Binary_Tree.md)
++   [105. Construct Binary Tree from Preorder and Inorder Traversal](0105._Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.md)
++   [106. Construct Binary Tree from Inorder and Postorder Traversal](0106._Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.md)
++   [107.Binary Tree Level Order Traversal II](0107._Binary_Tree Level_Order_Traversal_II.md)
++   [108. Convert Sorted Array to Binary Search Tree](0108._Convert_Sorted_Array_to_Binary_Search_Tree.md)
++   [109. Convert Sorted List to Binary Search Tree](0109._Convert_Sorted_List_to_Binary_Search_Tree.md)
++   [110.Balanced Binary Tree](0110._Balanced_Binary_Tree.md)
++   [111. Minimum Depth of Binary Tree](0111._Minimum_Depth_Of_Binary_Tree.md)
++   [112. Path Sum](0112._Path_Sum.md)
++   [114. Flatten Binary Tree to Linked List](0114._Flatten_Binary_Tree_to_Linked_List.md)
++   [115.Distinct Subsequences](0115._Distinct_Subsequences.md)
++   [118. Pascal's Triangle](0118._Pascals_Triangle.md)
++   [119. Pascal's Triangle II](0119._Pascals_Triangle-II.md)
++   [120. Triangle](0120._Triangle.md)
++   [121. Best Time to Buy and Sell Stock](0121._Best_Tim_ to_Buy_and_Sell_Stock.md)
++   [122. Best Time to Buy and Sell Stock II](0122._Best_Time_to_Buy_and_Sell_Stock_II.md)
++   [123. Best Time to Buy and Sell Stock III](0123._Best_Time_to_Buy _and_Sell_Stock_III.md)
++   [124. Binary Tree Maximum Path Sum](0124._Binary_Tree_Maximum_Path_Sum.md)
++   [127. Word Ladder](0127._Word_Ladde.md)
++   [128. Longest Consecutive Sequence](0128._Longest_Consecutive_Sequence.md)
++   [129. Sum Root to Leaf Numbers](0129._Sum_Root_to_Leaf_Numbers.md)
++   [131. Palindrome Paritionaing](0131._Palindrome_Partitioning.md)
++   [136. Single Numbe](0136._Single_Numbe.md)
++   [137.Single Number II](0137._Single_Number_II.md)
++   [ˢ������](0141._Linked_List_Cycle.md)
++   [142. linked list cycle II](0142._Linked_List_Cycle_II.md)
++   [144. Binary Tree Preorder Traversal](0144._Binary_Tree_Preorder_Traversal.md)
++   [145. Binary Tree Postorder Traversal](0145._Binary_Tree_Postorder_Traversal.md)
++   [147. Insertion Sort List](0147._Insert_on_Sort_List.md)
++   [148.Sort list](0148._Sort _list.md)
++   [151. Reverse Words in a String](0151._Reverse_Words_in_a_String.md)
++   [153. Find Minimum in Rotated Sorted Array](0153._Find_Minimum_in_Rotated_Sorted_Array.md)
++   [154. Find Minimum in Rotated Sorted Array II](0154._Find_Minimum_in_Rotated_Sorted_Array-II.md)
++   [160 intersection_of_Two_Linked_Lists](0160._Intersection_Of_Two_Linked_Lists.md)
++   [164. Maximum Gap](0164._Maximum_Gap.md)
++   [166. Fraction to Recurring Decimal](0166._Fraction_to_Recurring_Decimal.md)
++   [167. Two Sum II - Input array is sorted](0167._Two_Sum_II-Input_array_is_sorted.md)
++   [199. Binary Tree Right Side View](0199._Binary_Tree_Right_Side_View.md)
++   [216. Combination Sum III](0216._Combination_Sum_III.md)
++   [230. Kth Smallest Element in a BST](0230._Kth_Smallest_Element_in_a_BST.md)
++   [260. Single Number III](0260._Single_Number_III.md)
++   [287. Find the Duplicate Number](0287._Find_the_Duplicate_Number.md)
++   [326. Power_of_Three](0326._Power_Of_Three.md)
++   [328. Odd Even Linked List](0328._Odd_Even_Linked_List.md)
++   [329. Longest Increasing Path in a Matrix](0329._Longest_Increasing_Path_in_a_Matrix.md)
++   [338. Counting Bits ](0338._Counting_Bits.md)
++   [413. Arithmetic Slices](0413._Arithmetic_Slices.md)
++   [442. Find All Duplicates in an Array](0442._Find_All_Duplicates_in_an_Array.md)
++   [513. Find Bottom Left Tree Value](0513._Find_Bottom_Left_Tree_Value.md)
++   [515. Find Largest Value in Each Tree Row](0515._Find_Largest_Value_in_Each_Tree_Row.md)
++   [540. Single Element in a Sorted Array](0540._Single_Element_in_a_Sorted_Array.md)
++   [581. Shortest Unsorted Continuous Subarray](0581._Shortest_Unsorted_Continuous_Subarray.md)
++   [793. K Inverse Pairs Array](0629._K_Inverse_Pairs_Array.md)
++   [632. Smallest Range](0632._Smallest_Range.md)
++   [654. Maximum Binary Tree ](0654._maximum_binary_tree.md)
++   [668. Kth Smallest Number in Multiplication Table](0668._Kth_Smallest_Number_in_Multiplication_Table.md)
++   [701. Insert into a Binary Search Tree](0701._Insert_into_a_Binary_Search_Tree.md)
++   [715. Range Module](0715._Range_Module.md)
++   [793. Find K-th Smallest Pair Distance](0719._Find_K-th_Smallest_Pair_Distance.md)
++   [739. Daily Temperatures](0739._Daily_Temperatures.md)
++   [797. All Paths From Source to Target](0797._All_Paths_From_Source_To_Target.md)
++   [814. Binary Tree Pruning](0814._Binary_Tree_Pruning.md)
++   [841. Keys and Rooms](0841._Keys_and_Rooms.md)
++   [877. Stone Game](0877._Stone_Game.md)
++   [945. Minimum Increment to Make Array Unique](0945._Minimum_Increment_to_Make_Array_Unique.md)
++   [946. Validate Stack Sequences](0946._Validate_Stack_Sequences.md)
++   [947. Most Stones Removed with Same Row or Column](0947._Most_Stones_Removed_with_Same_Row_or_Column.md)
++   [948. Bag of Tokens](0948._Bag_of_Tokens.md)
++   [949. Largest Time for Given Digits](0949._Largest_Time_for_Given_Digits.md)
++   [950. Reveal Cards In Increasing Order](0950._Reveal_Cards_In_Increasing_Order.md)
++   [951. Flip Equivalent Binary Trees](0951._Flip_Equivalent_Binary_Trees.md)
++   [952. Largest Component Size by Common Factor](0952._Largest_Component_Size_by_Common_Factor.md)

docs/leetcode/java/README.md

@@ -0,0 +1 @@
+# Leetcode Java 题解

docs/leetcode/java/SUMMARY.md

@@ -0,0 +1,41 @@
++   [Leetcode Java 题解](README.md)
++   [1. Two Sum](0001._Two_Sum.md)
++   [2. Add Two Numbers](0002._add_two_numbers.md)
++   [3. Longest Substring Without Repeating Characters](0003._Longest_Substring_Without_Repeating_Characters.md)
++   [4. Median of Two Sorted Arrays](0004._Median_of_Two_Sorted_Arrays.md)
++   [5. Longest Palindromic Substring](0005._Longest_Palindromic_Substring.md)
++   [6. ZigZag Conversion](0006._ ZigZag_Conversion.md)
++   [7. Reverse Integer](0007._Reverse_Integer.md)
++   [23. Merge K Sorted Lists](0023._Merge_K_Sorted_Lists.md)
++   [141. Linked List Cycle](0141._linked_list_cycle.md)
++   [218. The Skyline Problem](0218._The_Skyline_Problem.md)
++   [238. Product of Array Except Self](0238._product_of_array_except_self.md)
++   [342. Power of Four](0342._Power_of_Four.md)
++   [403. Frog Jump](0403._Frog_Jump.md)
++   [757. Set Intersection Size At Least Two](0757._Set_Intersection_Size_At_Least_Two.md)
++   [768. Max Chunks To Make Sorted II](0768._Max_Chunks_To_Make_Sorted_II.md)
++   [780. Reaching Points](0780._Reaching_Points.md)
++   [793. Preimage Size of Factorial Zeroes Function](0793._Preimage_Size_of_Factorial_Zeroes_Function.md)
++   [827. Making A Large Island](0827._Making_A_Large_Island.md)
++   [828. Unique Letter String](0828._Unique_Letter_String.md)
++   [834. Sum of Distances in Tree](0834._Sum_of_Distances_in_Tree.md)
++   [843. Guess the Word](0843._Guess_the_Word.md)
++   [847. Shortest Path Visiting All Nodes](0847._Shortest_Path_Visiting_All_Nodes.md)
++   [850. Rectangle Area II](0850._Rectangle_Area_II.md)
++   [854. K-Similar Strings](0854._K-Similar_Strings.md)
++   [857. Minimum Cost to Hire K Workers](0857._Minimum_Cost_to_Hire_K_Workers.md)
++   [862. Shortest Subarray with Sum at Least K](0862._Shortest_Subarray_with_Sum_at_Least_K.md)
++   [864. Shortest Path to Get All Keys](0864._Shortest_Path_to_Get_All_Keys.md)
++   [871. Minimum Number of Refueling Stops](0871._Minimum_Number_of_Refueling_Stops.md)
++   [878. Nth Magical Number](0878._Nth_Magical_Number.md)
++   [879. Profitable Schemes](0879._Profitable_Schemes.md)
++   [899. Reachable Nodes In Subdivided Graph](0882._Reachable_Nodes_In_Subdivided_Graph.md)
++   [887. Super Egg Drop](0887._Super_Egg_Drop.md)
++   [891. Sum of Subsequence Widths](0891._Sum_of_Subsequence_Widths.md)
++   [895. Maximum Frequency Stack](0895._Maximum_Frequency_Stack.md)
++   [899. Orderly Queue](0899._Orderly_Queue.md)
++   [902. Numbers At Most N Given Digit Set](0902._Numbers_At_Most_N_Given_Digit_Set.md)
++   [903. Valid Permutations for DI Sequence](0903._Valid_Permutations_for_DI_Sequence.md)
++   [906. Super Palindromes](0906._Super_Palindromes.md)
++   [913. Cat and Mouse](0913._Cat_and_Mouse.md)
++   [920. Number of Music Playlists](0920._Number_of_Music_Playlists.md)

docs/leetcode/javascript/README.md

@@ -1,3 +1,3 @@
-# Leetcode solutions and summarizations!
+# Leetcode JavaScript 题解
 
 > 看左侧栏，开始你的表演！