diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/search_2d_matrix2.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/search_2d_matrix2.cpp')
-rw-r--r-- | other/search_2d_matrix2.cpp | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/other/search_2d_matrix2.cpp b/other/search_2d_matrix2.cpp deleted file mode 100644 index 9834431..0000000 --- a/other/search_2d_matrix2.cpp +++ /dev/null @@ -1,20 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool searchMatrix(vector<vector<int>> &matrix, int target) { - int m = matrix.size(), n = matrix[0].size(); - if (m == 0) - return false; - int i = 0, j = n - 1; - while (i < m && j >= 0) { - if (matrix[i][j] == target) - return true; - else if (matrix[i][j] > target) - j--; - else - i++; - } - return false; - } -}; |