diff options
| author | Yuqian Yang <crupest@crupest.life> | 2025-02-12 15:55:21 +0800 |
|---|---|---|
| committer | Yuqian Yang <crupest@crupest.life> | 2025-02-12 16:04:50 +0800 |
| commit | 77e6cdc863d2cbd9df578a665804daf28d8593fe (patch) | |
| tree | 62c9f3e071d8d1d6fe125fe801907db11784332e /works/solutions/leetcode/cpp/74.cpp | |
| parent | 10eb95869601e145b1d8bc909424777c25752d51 (diff) | |
| parent | a557fa36a22c5ef4a29da596ee1e3aa10be55984 (diff) | |
| download | crupest-77e6cdc863d2cbd9df578a665804daf28d8593fe.tar.gz crupest-77e6cdc863d2cbd9df578a665804daf28d8593fe.tar.bz2 crupest-77e6cdc863d2cbd9df578a665804daf28d8593fe.zip | |
import(solutions): IMPORT crupest/solutions COMPLETE.
Diffstat (limited to 'works/solutions/leetcode/cpp/74.cpp')
| -rw-r--r-- | works/solutions/leetcode/cpp/74.cpp | 63 |
1 files changed, 63 insertions, 0 deletions
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;
+ }
+};
|