Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- # coding=utf-8
- """
- # 用二维列表来表示该 M*N 矩阵, 左 -> 右,递增; 下 -> 上,递增。
- # 从右下角出发,与target比较
- # 若大于target, 删去该列(因为该列必定都大于target);
- # 若小于target,删去该行(因为该行都小于target)
- # 直到列表为[] => target不存在
- """
- def re_find(matrix, m, n, target):
- if matrix[m][n] == target:
- return True
- elif matrix[m][n] > target:
- for i in range(len(matrix)):
- matrix[i].pop()
- else:
- matrix.pop()
- if not matrix:
- return False
- return re_find(matrix, len(matrix)-1, len(matrix[0])-1, target)
Add Comment
Please, Sign In to add comment