update 74 34

Author: geemaple

README.md

@@ -44,7 +44,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [✅] | [blind75.md](./list/blind75.md) | 77/77 | - |
 | [✅] | [geekbang.md](./list/geekbang.md) | 55/55 | - |
 | [✅] | [leetcode101.md](./list/leetcode101.md) | 183/184 | 1 vip |
-| [🔲] | [9c-basic.md](./list/9c-basic.md) | 4/128 | 2 vips |
+| [🔲] | [9c-basic.md](./list/9c-basic.md) | 7/128 | 3 vips |
 | [🔲] | [9c-top.md](./list/9c-top.md) | 5/48 | - |
 | [🔲] | [leetcode-contest.md](./list/leetcode-contest.md) | 10/56 | - |
 | [🔲] | [leetcode-google.md](./list/leetcode-google.md) | 0/7 | - |

leetcode/34.find-first-and-last-position-of-element-in-sorted-array.cpp

@@ -54,4 +54,17 @@ class Solution {
 
         return start;
     }
+};
+
+class Solution {
+public:
+    vector<int> searchRange(vector<int>& nums, int target) {
+        auto first = lower_bound(nums.begin(), nums.end(), target);
+        if (first == nums.end() || *first != target) {
+            return vector<int>{-1, -1};
+        }   
+
+        auto last = lower_bound(nums.begin(), nums.end(), target + 1);
+        return vector<int>{int(first - nums.begin()), int(last - nums.begin() - 1)};
+    }
 };

leetcode/74.search-a-2d-matrix.cpp

@@ -37,25 +37,27 @@
 class Solution {
 public:
     bool searchMatrix(vector<vector<int>>& matrix, int target) {
-        int m = matrix.size(), n = matrix[0].size();
-        int start = 0;
-        int end = m * n;
+        int m = matrix.size();
+        int n = matrix[0].size();
+        int left = 0;
+        int right = m * n - 1;
 
-        while (start < end) {
-            int mid = start + (end - start) / 2;
+        while (left < right) {
+            int mid = left + (right - left) / 2;
             int i = mid / n, j = mid % n;
 
             if (matrix[i][j] == target) {
                 return true;
             }
 
             if (matrix[i][j] > target) {
-                end = mid;
+                right = mid;
             } else {
-                start = mid + 1;
+                left = mid + 1;
             }
         }
 
-        return false;
+        int i = left / n, j = left % n;
+        return matrix[i][j] == target;
     }
 };

leetcode/74.search-a-2d-matrix.py

@@ -34,28 +34,23 @@
 #  
 #  
 
-class Solution(object):
-    def searchMatrix(self, matrix, target):
-        """
-        :type matrix: List[List[int]]
-        :type target: int
-        :rtype: bool
-        """
-        m = len(matrix)
-        n = len(matrix[0])
-        start = 0
-        end = m * n
-
-        while start < end:
-            mid = start + (end - start) // 2
-            i, j = mid // n, mid % n
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        n = len(matrix)
+        m = len(matrix[0])
+        left = 0
+        right = n * m - 1
 
+        while left < right:
+            mid = left + (right - left) // 2
+            i, j = mid // m, mid % m
             if matrix[i][j] == target:
                 return True
 
-            if matrix[i][j] > target:
-                end = mid
+            if matrix[i][j] < target:
+                left = mid + 1
             else:
-                start = mid + 1
+                right = mid
 
-        return False
+        i, j = left // m, left % m
+        return matrix[i][j] == target

lintcode/462.total-occurrence-of-target.vip

@@ -13,12 +13,11 @@
 6. https://leetcode.com/problems/first-bad-version/
 7. https://www.lintcode.com/problem/search-in-a-big-sorted-array/
 8. https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
+9. https://leetcode.com/problems/search-a-2d-matrix/
+10. https://leetcode.com/problems/search-a-2d-matrix-ii/
+11. https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
+12. https://www.lintcode.com/problem/total-occurrence-of-target/
 
-
-- https://www.lintcode.com/problem/search-a---matrix/
-- https://www.lintcode.com/problem/search-a---matrix-ii/
-- https://www.lintcode.com/problem/search-for-a-range/
-- https://www.lintcode.com/problem/total-occurrence-of-target/
 - https://www.lintcode.com/problem/maximum-number-in-mountain-sequence/
 - https://www.lintcode.com/problem/smallest-rectangle-enclosing-black-pixels/
 - https://www.lintcode.com/problem/find-peak-element/