From 185ef9fcb0e59f13e9ee0ccb261693cdaddebab0 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: import(solutions): Move leetcode solutions to subdir.

---
 works/solutions/leetcode/cpp/74.cpp | 63 +++++++++++++++++++++++++++++++++++++
 1 file changed, 63 insertions(+)
 create mode 100644 works/solutions/leetcode/cpp/74.cpp

(limited to 'works/solutions/leetcode/cpp/74.cpp')

diff --git a/works/solutions/leetcode/cpp/74.cpp b/works/solutions/leetcode/cpp/74.cpp
new file mode 100644
index 0000000..08560ef
--- /dev/null
+++ b/works/solutions/leetcode/cpp/74.cpp
@@ -0,0 +1,63 @@
+#include <vector>
+
+using std::vector;
+
+class Solution
+{
+public:
+    bool searchMatrix(vector<vector<int>> &matrix, int target)
+    {
+        if (matrix.empty() || matrix.front().empty())
+            return false;
+
+        int top_row = 0;
+        int bottom_row = matrix.size() - 1;
+        while (top_row != bottom_row)
+        {
+            const int middle_row = (top_row + bottom_row) / 2;
+            const int middle_row_p1 = middle_row + 1;
+            const int middle_p1_row_front = matrix[middle_row_p1].front();
+            if (middle_p1_row_front > target)
+            {
+                bottom_row = middle_row;
+            }
+            else if (middle_p1_row_front < target)
+            {
+                top_row = middle_row_p1;
+            }
+            else if (middle_p1_row_front == target)
+            {
+                return true;
+            }
+        }
+
+        const vector<int> &row = matrix[top_row];
+
+        if (row.size() == 1)
+        {
+            return row.front() == target;
+        }
+
+        int left = 0;
+        int right = row.size() - 1;
+
+        while (left != right)
+        {
+            const int middle = (left + right) / 2;
+            const int middle_value = row[middle];
+            if (middle_value == target)
+            {
+                return true;
+            }
+            else if (middle_value < target)
+            {
+                left = middle + 1;
+            }
+            else
+            {
+                right = middle;
+            }
+        }
+        return row[left] == target;
+    }
+};
-- 
cgit v1.2.3