# -*- coding:utf-8 -*- class Solution: # array 二维列表 def Find(self, target, array): # write code here if(array == [[]]): return 0 raw = len(array) cow = len(array[0]) i = raw - 1 j = 0 flag = array[i][j] while((i > 0) and (j < cow - 1)): if(flag >= target): i -= 1 if(flag <= target): j += 1 flag = array[i][j] if(flag == target): return 1 return 0 sol = Solution() print(sol.Find(0,[[1,2,8,9],[2,4,9,12],[4,7,10,13],[6,8,11,15]]))
剑指offer习题一
猜你喜欢
转载自blog.csdn.net/u012693077/article/details/80781793
今日推荐
周排行