leetcode1337

class Solution:
    def kWeakestRows(self, mat: 'List[List[int]]', k: int) -> 'List[int]':
        m = len(mat)
        n = len(mat[0])
        counter = [0] * m
        for i in range(m):
            for j in range(n):
                if mat[i][j] == 1:
                    counter[i] += 1
                else:
                    break
        #print(counter)
        at = []
        for i in range(len(counter)):
            at.append((i,counter[i]))
        at = sorted(at,key=lambda x:(x[1],x[0]))
        result = []
        for x in range(k):
            result.append(at[x][0])
        return result

算法思路：排序。