添加复杂度信息

Author: soulmachine

C++/chapSearching.tex

@@ -24,7 +24,8 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, Search for a Range
-// 偷懒的做法
+// 偷懒的做法，使用STL
+// 时间复杂度O(logn)，空间复杂度O(1)
 class Solution {
 public:
     vector<int> searchRange(int A[], int n, int target) {
@@ -41,6 +42,7 @@ \subsubsection{代码}
 \begin{Code}
 // LeetCode, Search for a Range
 // 重新实现 lower_bound 和 upper_bound
+// 时间复杂度O(logn)，空间复杂度O(1)
 class Solution {
 public:
     vector<int> searchRange (int A[], int n, int target) {
@@ -113,6 +115,7 @@ \subsubsection{代码}
 \begin{Code}
 // LeetCode, Search Insert Position
 // 重新实现 lower_bound
+// 时间复杂度O(logn)，空间复杂度O(1)
 class Solution {
 public:
     int searchInsert(int A[], int n, int target) {
@@ -170,6 +173,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, Search a 2D Matrix
+// 时间复杂度O(logn)，空间复杂度O(1)
 class Solution {
 public:
     bool searchMatrix(const vector<vector<int>>& matrix, int target) {

C++/chapSorting.tex

@@ -18,6 +18,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 //LeetCode, Merge Sorted Array
+// 时间复杂度O(m+n)，空间复杂度O(1)
 class Solution {
 public:
     void merge(int A[], int m, int B[], int n) {
@@ -55,6 +56,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 //LeetCode, Merge Two Sorted Lists
+// 时间复杂度O(m+n)，空间复杂度O(1)
 class Solution {
 public:
     ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
@@ -98,6 +100,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 //LeetCode, Merge k Sorted Lists
+// 时间复杂度O(n1+n2+...)，空间复杂度O(1)
 class Solution {
 public:
     ListNode *mergeKLists(vector<ListNode *> &lists) {
@@ -158,6 +161,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, First Missing Positive
+// 时间复杂度O(n)，空间复杂度O(1)
 class Solution {
 public:
     int firstMissingPositive(int A[], int n) {
@@ -221,6 +225,7 @@ \subsubsection{代码}
 \begin{Code}
 // LeetCode, Sort Colors
 // Counting Sort
+// 时间复杂度O(n)，空间复杂度O(1)
 class Solution {
 public:
     void sortColors(int A[], int n) {
@@ -239,7 +244,7 @@ \subsubsection{代码}
 
 \begin{Code}
 // LeetCode, Sort Colors
-// 双指针
+// 双指针，时间复杂度O(n)，空间复杂度O(1)
 class Solution {
 public:
     void sortColors(int A[], int n) {
@@ -261,6 +266,7 @@ \subsubsection{代码}
 \begin{Code}
 // LeetCode, Sort Colors
 // use partition()
+// 时间复杂度O(n)，空间复杂度O(1)
 class Solution {
 public:
     void sortColors(int A[], int n) {
@@ -273,6 +279,7 @@ \subsubsection{代码}
 \begin{Code}
 // LeetCode, Sort Colors
 // 重新实现 partition()
+// 时间复杂度O(n)，空间复杂度O(1)
 class Solution {
 public:
     void sortColors(int A[], int n) {

C++/chapTree.tex

@@ -724,7 +724,30 @@ \subsubsection{代码}
 递归版
 \begin{Code}
 // LeetCode, Flatten Binary Tree to Linked List
-// 递归版1
+// 递归版1，时间复杂度O(n)，空间复杂度O(logn)
+class Solution {
+public:
+    void flatten(TreeNode *root) {
+        if (root == nullptr) return;  // 终止条件
+
+        flatten(root->left);
+        flatten(root->right);
+
+        if (nullptr == root->left) return;
+
+        // 三方合并，将左子树所形成的链表插入到root和root->right之间
+        TreeNode *p = root->left;
+        while(p->right) p = p->right; //寻找左链表最后一个节点
+        p->right = root->right;
+        root->right = root->left;
+        root->left = nullptr;
+    }
+};
+\end{Code}
+
+\begin{Code}
+// LeetCode, Flatten Binary Tree to Linked List
+// 递归版2
 // @author 王顺达(http://weibo.com/u/1234984145)
 // 时间复杂度O(n)，空间复杂度O(logn)
 class Solution {
@@ -744,36 +767,6 @@ \subsubsection{代码}
 };
 \end{Code}
 
-\begin{Code}
-// LeetCode, Flatten Binary Tree to Linked List
-// 递归版2，时间复杂度O(n)，空间复杂度O(logn)
-class Solution {
-public:
-    void flatten(TreeNode *root) {
-        if (root == nullptr) return;  // 终止条件
-        //1.flat the left subtree
-        if (root->left) flatten(root->left);
-
-        //2.flatten the right subtree
-        if (root->right) flatten(root->right);
-
-        //3.if no left return
-        if (nullptr == root->left) return;
-
-        //4.insert left sub tree between root and root->right
-        //4.1.find the last node in left
-        TreeNode *p = root->left;
-        while(p->right) p = p->right;
-        p->right = root->right;
-        //4.2.connect right sub tree after left sub tree
-        p->right = root->right;
-        //4.3.move left sub tree to the root's right sub tree
-        root->right = root->left;
-        root->left = nullptr;
-    }
-};
-\end{Code}
-
 迭代版
 \begin{Code}
 // LeetCode, Flatten Binary Tree to Linked List