update 53, 215

Author: geemaple

README.md

@@ -45,7 +45,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [✅] | [9c-dp.md](./list/9c-dp.md) | 42/45 | 3 vips |
 | [✅] | [geekbang.md](./list/geekbang.md) | 55/55 | - |
 | [✅] | [leetcode101.md](./list/leetcode101.md) | 183/184 | 1 vip |
-| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 66/92 | 16 vips |
+| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 67/92 | 17 vips |
 | [🔲] | [leetcode-contest.md](./list/leetcode-contest.md) | 10/40 | - |
 | [🔲] | [leetcode-google.md](./list/leetcode-google.md) | 0/7 | - |
 

leetcode/215.kth-largest-element-in-an-array.cpp

@@ -49,27 +49,6 @@ class Solution {
 };
 
 class Solution {
-private:
-    int partition(vector<int>& nums, int start, int end) {
-        int l = start + 1;
-        int r = end;
-        int pivot = nums[start];
-
-        while (l <= r) {
-            if (nums[l] > pivot && nums[r] < pivot) {
-                swap(nums[l++], nums[r--]);
-            }
-            if (nums[l] <= pivot) {
-                l++;
-            }
-            if (nums[r] >= pivot) {
-                r--;
-            }
-        }
-        swap(nums[start], nums[r]);
-        return r;
-    }
-
 public:
     int findKthLargest(vector<int>& nums, int k) {
 
@@ -90,4 +69,24 @@ class Solution {
 
         return nums[k];
     }
-};
+
+    int partition(vector<int>& nums, int start, int end) {
+        int l = start + 1;
+        int r = end;
+        int pivot = nums[start];
+
+        while (l <= r) {
+            if (nums[l] > pivot && nums[r] < pivot) {
+                swap(nums[l], nums[r]);
+            }
+            if (nums[l] <= pivot) {
+                l++;
+            }
+            if (nums[r] >= pivot) {
+                r--;
+            }
+        }
+        swap(nums[start], nums[r]);
+        return r;
+    }
+};

leetcode/215.kth-largest-element-in-an-array.py

@@ -74,8 +74,6 @@ def partition(self, nums, start, end):
         while l <= r:
             if (nums[l] > pivot and nums[r] < pivot):
                 nums[l], nums[r] = nums[r], nums[l]
-                l += 1
-                r -= 1
 
             if nums[l] <= pivot:
                 l += 1

leetcode/53.maximum-subarray.cpp

@@ -66,4 +66,37 @@ class Solution {
 
         return largest;
     }
+};
+
+// follow-up
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        return helper(nums, 0, nums.size() - 1);
+    }
+
+    int helper(vector<int>& nums, int left, int right) {
+        if (left == right) {
+            return nums[left];
+        }
+
+        int mid = (left + right) >> 1; 
+        int cur = 0;
+        int left_max = INT_MIN;
+        for (int i = mid; i >= left; i--) {
+            cur += nums[i];
+            left_max = max(left_max, cur);
+        }
+
+        cur = 0;
+        int right_max = INT_MIN;
+        for (int i = mid + 1; i <= right; i++) {
+            cur += nums[i];
+            right_max = max(right_max, cur);
+        }
+
+        int child_max = max(helper(nums, left, mid), helper(nums, mid + 1, right));
+        return max(child_max, left_max + right_max);
+
+    }
 };

leetcode/53.maximum-subarray.py

@@ -63,6 +63,7 @@ def maxSubArray(self, nums: List[int]) -> int:
 
         return largest
 
+# follow-up
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
         return self.helper(nums, 0, len(nums) - 1)

lintcode/403.continuous-subarray-sum-ii.vip

@@ -99,10 +99,10 @@
 80. https://www.lintcode.com/problem/subarray-sum-closest/
 81. https://www.lintcode.com/problem/submatrix-sum/
 82. https://www.lintcode.com/problem/continuous-subarray-sum/
+83. https://www.lintcode.com/problem/maximum-subarray/
+84. https://www.lintcode.com/problem/continuous-subarray-sum-ii/
+85. https://leetcode.com/problems/kth-largest-element-in-an-array/
 
-- https://www.lintcode.com/problem/maximum-subarray/
-- https://www.lintcode.com/problem/continuous-subarray-sum-ii/
-- https://www.lintcode.com/problem/kth-largest-element/
 - https://www.lintcode.com/problem/wiggle-sort/
 - https://www.lintcode.com/problem/wiggle-sort-ii/
 - https://www.lintcode.com/problem/nuts-bolts-problem/

list/9c-advanced.md

@@ -305,7 +305,10 @@ def list_table(f):
 
             if len(missing) > 0:
                 Logger.log(f'----{file_name} missing {len(missing)} link----', Logger.WARNING)
-                Logger.log(f'{random.sample(missing, 5)}')
+                if len(missing) >= 5:
+                    Logger.log(f'{random.sample(missing, 5)}')
+                else:
+                    Logger.log(f'{missing}')
 
         Markdown.table_header(f, ['Status', 'List', 'Progress', 'Notes'])
         for row in sorted(list_row):