2020-09-27 21:34:35

Author: wizardforcel

SUMMARY.md

@@ -5,7 +5,7 @@
     +   [3. Longest Substring Without Repeating Characters](docs/leetcode/cpp/0003._Longest_Substring_Without_Repeating_Characters.md)
     +   [004. Median of Two Sorted Arrays](docs/leetcode/cpp/0004._Median_of_Two_Sorted_Arrays.md)
     +   [5. Longest Palindromic Substring](docs/leetcode/cpp/0005._Longest_Palindromic_Substring.md)
-    +   [6. ZigZag Conversion](docs/leetcode/cpp/0006._ZigZag _Conversion.md)
+    +   [6. ZigZag Conversion](docs/leetcode/cpp/0006._ZigZag_Conversion.md)
     +   [7. Reverse Integer](docs/leetcode/cpp/0007._Reverse_Integer.md)
     +   [8. String to Integer (atoi)](docs/leetcode/cpp/0008._String_to_Integer_(atoi).md)
     +   [9. Palindrome Number](docs/leetcode/cpp/0009._Palindrome_Number.md)
@@ -19,7 +19,7 @@
     +   [18. 4Sum](docs/leetcode/cpp/0018._4Sum.md)
     +   [19. Remove Nth Node From End of List](docs/leetcode/cpp/0019._Remove_Nth_Node_From_End_of_List.md)
     +   [20. Valid Parentheses](docs/leetcode/cpp/0020._Valid_Parentheses.md)
-    +   [21. Merge Two Sorted Lists](docs/leetcode/cpp/0021._Merge _Two _Sorted _Lists.md)
+    +   [21. Merge Two Sorted Lists](docs/leetcode/cpp/0021._Merge_Two_Sorted_Lists.md)
     +   [22. Generate Parentheses](docs/leetcode/cpp/0022._Generate_Parentheses.md)
     +   [23. merge k sorted lists](docs/leetcode/cpp/0023._Merge_K_Sorted_Lists.md)
     +   [24. Swap Nodes in Pairs](docs/leetcode/cpp/0024._Swap_Nodes_in_Pairs.md)
@@ -48,7 +48,7 @@
     +   [49. Group Anagrams](docs/leetcode/cpp/0048._Rotate_Image.md)
     +   [49. Group Anagrams](docs/leetcode/cpp/0049._Group_Anagrams.md)
     +   [50. powx n](docs/leetcode/cpp/0050._powx_n.md)
-    +   [51. N-Queens](docs/leetcode/cpp/0051._ N-Queens.md)
+    +   [51. N-Queens](docs/leetcode/cpp/0051._N-Queens.md)
     +   [52. N-Queens II](docs/leetcode/cpp/0052._N-Queens_II.md)
     +   [053. Maximum Subarray](docs/leetcode/cpp/0053._Maximum_Subarray.md)
     +   [54. Spiral Matrix](docs/leetcode/cpp/0054._Spiral_Matrix.md)
@@ -101,7 +101,7 @@
     +   [120. Triangle](docs/leetcode/cpp/0120._Triangle.md)
     +   [121. Best Time to Buy and Sell Stock](docs/leetcode/cpp/0121._Best_Tim_ to_Buy_and_Sell_Stock.md)
     +   [122. Best Time to Buy and Sell Stock II](docs/leetcode/cpp/0122._Best_Time_to_Buy_and_Sell_Stock_II.md)
-    +   [123. Best Time to Buy and Sell Stock III](docs/leetcode/cpp/0123._Best_Time_to_Buy _and_Sell_Stock_III.md)
+    +   [123. Best Time to Buy and Sell Stock III](docs/leetcode/cpp/0123._Best_Time_to_Buy_and_Sell_Stock_III.md)
     +   [124. Binary Tree Maximum Path Sum](docs/leetcode/cpp/0124._Binary_Tree_Maximum_Path_Sum.md)
     +   [127. Word Ladder](docs/leetcode/cpp/0127._Word_Ladde.md)
     +   [128. Longest Consecutive Sequence](docs/leetcode/cpp/0128._Longest_Consecutive_Sequence.md)
@@ -114,7 +114,7 @@
     +   [144. Binary Tree Preorder Traversal](docs/leetcode/cpp/0144._Binary_Tree_Preorder_Traversal.md)
     +   [145. Binary Tree Postorder Traversal](docs/leetcode/cpp/0145._Binary_Tree_Postorder_Traversal.md)
     +   [147. Insertion Sort List](docs/leetcode/cpp/0147._Insert_on_Sort_List.md)
-    +   [148.Sort list](docs/leetcode/cpp/0148._Sort _list.md)
+    +   [148.Sort list](docs/leetcode/cpp/0148._Sort_list.md)
     +   [151. Reverse Words in a String](docs/leetcode/cpp/0151._Reverse_Words_in_a_String.md)
     +   [153. Find Minimum in Rotated Sorted Array](docs/leetcode/cpp/0153._Find_Minimum_in_Rotated_Sorted_Array.md)
     +   [154. Find Minimum in Rotated Sorted Array II](docs/leetcode/cpp/0154._Find_Minimum_in_Rotated_Sorted_Array-II.md)

docs/leetcode/cpp/0006._ZigZag _Conversion.md renamed to docs/leetcode/cpp/0006._ZigZag_Conversion.md

@@ -1,24 +1,24 @@
-#35.search insert position
+# 35.search insert position
 
-**<font color=red>难度:Easy</font>**
+**<font color=red>难度:Easy</font>**
 
-## 刷题内容
+## 刷题内容
 
-> 原题连接
+> 原题连接
 
 *https://leetcode.com/problems/search-insert-position/
 * 
-> 内容描述
+> 内容描述
 
 ```
 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
 
 You may assume no duplicates in the array.
 ```
-> 思路1
-******- 时间复杂度: O(lgN)******- 空间复杂度: O(1)******
+> 思路1
+******- 时间复杂度: O(lgN)******- 空间复杂度: O(1)******
 
-由于数组是已经排序好的，这就是一个很典型的二分法
+由于数组是已经排序好的，这就是一个很典型的二分法
 
 ```cpp
 class Solution {
@@ -44,11 +44,11 @@ public:
     }
 };
 ```
-> 思路2
-******- 时间复杂度: O(lgN)******- 空间复杂度: O(1)******
+> 思路2
+******- 时间复杂度: O(lgN)******- 空间复杂度: O(1)******
 
-其实这个思路也是二分法，只不过c++中已经给我们封装好了lower_bound，我们直接调用即可
-代码看上去也简洁很多
+其实这个思路也是二分法，只不过c++中已经给我们封装好了lower_bound，我们直接调用即可
+代码看上去也简洁很多
 ```cpp
 class Solution {
 public:

docs/leetcode/cpp/0021._Merge _Two _Sorted _Lists.md renamed to docs/leetcode/cpp/0021._Merge_Two_Sorted_Lists.md

@@ -4,7 +4,7 @@
 +   [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)
++   [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)
@@ -32,7 +32,7 @@
 +   [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)
++   [35.search insert position](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)
@@ -87,7 +87,7 @@
 +   [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)
++   [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)
@@ -98,7 +98,7 @@
 +   [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)
++   [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)

docs/leetcode/cpp/0035._Search_Insert_Position.md

@@ -4,7 +4,7 @@
 +   [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)
++   [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)