在行列都有序的二維數組中找數python實現

#File Name : 在行列都有序的數組中找數.py def findNumInSortMatrix(arr,k): if not arr: return end_r = len(arr) - 1 end_c = len(arr[0]) - 1 zr = 0 zc = end_c while zr != end_r+1 and

>>阅读原文<<