Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Search a 2D Matrix
bool searchMatrix(vector<vector<int>>& matrix, int target) { int m=matrix.size(); if(m==0) return false; int n=matrix[0].size(); int i=0; int j=n-1; while(i<=m-1 && j>=0) { if(matrix[i][j]==target) { return true; } else if(matrix[i][j]>target) { j--; } else { i++; } } return false; } };
run
|
edit
|
history
|
help
0
Jilebi Nimki
myfirst.cpp
Tejas choudhari
Continuous Sub Set with given sum
1163. Last Substring in Lexicographical Order
HW0
Tree
vector destruction - gcc
HTML Node
test