按照元組的第一個元素來排列。
class Solution:
def cutOffTree(self, forest):
M = len(forest)
N = len(forest[0])
trees = []
for i in range(M):
for j in range(N):
if (forest[i][j] > 1):
trees.append((forest[i][j], i, j))
trees.sort()
print(trees)
[Python crawler combat] Do not produce novels, only porters of the website, too awesome~ (with source code)
前言遇見你時,漫天星河皆為浮塵不知從什麼時候開始.小說開始掀
