Re: [閒聊] 每日leetcode

[DJYOSHITAKA (franchouchouISBEST)]

好像也只能照著寫
一二三四五
又水了一題

class FindSumPairs:

    def __init__(self, nums1: List[int], nums2: List[int]):
        self.nums1 = nums1
        self.nums2 = nums2
        self.mp1 = Counter(self.nums1)
        self.mp2 = Counter(self.nums2)

    def add(self, index: int, val: int) -> None:
        self.mp2[self.nums2[index]] -= 1
        self.mp2[self.nums2[index]+val] += 1
        self.nums2[index] += val

    def count(self, tot: int) -> int:
        cnt = 0
        for k, v in self.mp1.items():
            if (tot-k) in self.mp2:
                cnt += self.mp2[tot-k]*v
        return cnt

--

https://i.imgur.com/wRnmv7s.jpeg

https://i.imgur.com/mceoqQj.jpeg

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 220.132.58.28 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1751773604.A.BC2.html