剑指 Offer 03. 数组中重复的数字

• p40

class Solution {
public:
    int findRepeatNumber(vector<int>& nums) {
        int length = nums.size();
        if (length <= 0)
        {
            return false;
        }
        for (int i = 0; i < length; ++i)
        {
            if (nums[i] < 0 || nums[i] > length - 1)
            {
                return false;
            }
        }
        for (int i = 0; i < length; ++i)
        {
            while (nums[i] != i)
            {
                if (nums[i] == nums[nums[i]])
                {
                    return nums[i];
                }
                int t = nums[i];
                nums[i] = nums[t];
                nums[t] = t;
            }
        }
        return false;
    }
};

剑指 Offer 04. 二维数组中的查找

class Solution:
    def findNumberIn2DArray(self, matrix: List[List[int]], target: int) -> bool:
        if matrix == [] or matrix == [[]]:
            return False
        row = len(matrix)
        col = len(matrix[0])
        if target < matrix[0][0] or target > matrix[row-1][col-1]:
            return False
        
        r, c = 0, col-1
        while r < row and c >= 0:
            if matrix[r][c] == target:
                return True
            if matrix[r][c] < target:
                r = r + 1
            else:
                c = c - 1
        return False

原文地址：https://www.cnblogs.com/douzujun/p/14284411.html