LeetCode: Search a 2D Matrix

少数次过

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int m = matrix.size();
        int n = matrix[0].size();
        int left = 0;
        int right = m-1;
        int mid;
        while (left <= right) {
            mid = (left+right)/2;
            if (target == matrix[mid][0]) return true;
            if (target > matrix[mid][0]) left = mid+1;
            else right = mid-1;
        }
        int row = (left+right)/2;
        left = 0;
        right = n-1;
        while (left <= right) {
            mid = (left+right)/2;
            if (target == matrix[row][mid]) return true;
            if (target > matrix[row][mid]) left = mid+1;
            else right = mid-1;
        }
        return false;
    }
};

 C#

public class Solution {
    public bool SearchMatrix(int[,] matrix, int target) {
        int m = matrix.GetLength(0);
        int n = matrix.GetLength(1);
        int left = 0;
        int right = m - 1;
        int mid = 0;
        while (left <= right) {
            mid = (left + right) / 2;
            if (target == matrix[mid, 0]) return true;
            if (target > matrix[mid, 0]) left = mid + 1;
            else right = mid - 1;
        }
        int row = (left + right) / 2;
        left = 0;
        right = n - 1;
        while (left <= right) {
            mid = (left + right) / 2;
            if (target == matrix[row, mid]) return true;
            if (target > matrix[row, mid]) left = mid + 1;
            else right = mid - 1;
        }
        return false;
    }
}