leetcode-5.15[560. 和为K的子数组、1337. 方阵中战斗力最弱的 K 行]（python实现)

题目1

题解1

class Solution:
    def subarraySum(self, nums: List[int], k: int) -> int:
        hash={0:1}
        sum=0
        count=0
        for i in range(len(nums)):
            sum+=nums[i]
            if (sum-k) in hash:
                count+=hash[sum-k]
            if sum in hash:
                hash[sum]+=1
            else:
                hash[sum]=1
        print(hash)
        return count
    

附上题目链接

题目2

题解2

class Solution:
    def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
        res = []
        for i,l in enumerate(mat):
            count = l.count(1)
            res.append((count, i))
        res.sort(key=lambda x: x[0])
        res = [l[1] for l in res]
        return res[:k]

附上题目链接