leetcode: finished #74

content/leetcode/2023/8.md

@@ -3,6 +3,37 @@ title: "2023.8"
 draft: false
 ---
 
+# 2023.8.4
+
+```python
+#
+# @lc app=leetcode.cn id=74 lang=python3
+#
+# [74] 搜索二维矩阵
+#
+
+# @lc code=start
+from typing import List
+
+
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        if not matrix or not matrix[0]:
+            return False
+        row, col = 0, len(matrix[0]) - 1
+        while row <= len(matrix) - 1 and col >= 0:
+            if matrix[row][col] > target:
+                col -= 1
+            elif matrix[row][col] < target:
+                row += 1
+            elif matrix[row][col] == target:
+                return True
+        return False
+
+
+# @lc code=end
+```
+
 # 2023.8.3
 
 ```python