Lintcode 28. Search a 2D Matrix (Easy) (Python)

Search a 2D Matrix

Description:

Write an efficient algorithm that searches for a value in an m x n matrix.

This matrix has the following properties:

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.
Example
Consider the following matrix:

[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.

Challenge
O(log(n) + log(m)) time

Code:

1.

超时

class Solution:
    """
    @param matrix: matrix, a list of lists of integers
    @param target: An integer
    @return: a boolean, indicate whether matrix contains target
    """
    def searchMatrix(self, matrix, target):
        # write your code here
        if not matrix or matrix[0][0]>target or matrix[len(matrix)-1][len(matrix[0])-1]<target:
            return False
        lr = len(matrix)
        lc = len(matrix[0])

        i = math.floor(lr/2)
        lowBound = 0
        highBound = lr-1

        while True:
            head = matrix[i][0]
            tail = matrix[i][lc-1]
            if matrix[lr-1][0]<target:
                i = lr-1
                break
            elif matrix[1][0]>target:
                i = 0
                break
            elif head<target and tail>target:
                break
            elif head>target:
                highBound = i-1
                i = math.floor((lowBound+highBound)/2)
                continue
            elif tail<target:
                lowBound = i
                i = math.floor((lowBound+highBound)/2)
                continue
            elif head == target or tail == target:
                return True

        j = math.floor(lc/2)
        lowBound = 0
        highBound = lc-1
        if matrix[i][lc-1]<target:
            return False
        while True:

            if matrix[i][j]<target and matrix[i][j+1]>target:
                return False
            elif matrix[i][j] == target or matrix[i][j+1] == target:
                return True
            elif matrix[i][j]>target:
                highBound = j
                j = math.floor((lowBound+highBound)/2)
                continue
            elif matrix[i][j+1]<target:
                lowBound = j+1
                j = math.floor((lowBound+highBound)/2)
                continue

2.

修改后，OK

class Solution:
    """
    @param matrix: matrix, a list of lists of integers
    @param target: An integer
    @return: a boolean, indicate whether matrix contains target
    """
    def searchMatrix(self, matrix, target):
        # write your code here
        if not matrix or matrix[0][0]>target or matrix[len(matrix)-1][len(matrix[0])-1]<target:
            return False
        lr = len(matrix)
        lc = len(matrix[0])

        i = math.floor(lr/2)
        lowBound = 0
        highBound = lr-1

        while True:
            head = matrix[i][0]
            tail = matrix[i][lc-1]
            if matrix[highBound][0]<target:
                i = highBound
                break
            elif matrix[lowBound+1][0]>target:
                i = lowBound
                break
            elif head<target and tail>target:
                break
            elif head>target:
                highBound = i-1
                i = math.floor((lowBound+highBound)/2)
                continue
            elif tail<target:
                lowBound = i
                i = math.floor((lowBound+highBound)/2)
                continue
            elif head == target or tail == target:
                return True

        j = math.floor(lc/2)
        lowBound = 0
        highBound = lc-1
        if matrix[i][lc-1]<target:
            return False
        while True:

            if matrix[i][j]<target and matrix[i][j+1]>target:
                return False
            elif matrix[i][j] == target or matrix[i][j+1] == target:
                return True
            elif matrix[i][j]>target:
                highBound = j
                j = math.floor((lowBound+highBound)/2)
                continue
            elif matrix[i][j+1]<target:
                lowBound = j+1
                j = math.floor((lowBound+highBound)/2)
                continue