목록454. 4Sum II (1)

Scribbling

LeetCode: 454. 4Sum II

First thing to try is iterating nums1, nums2, nums3 and looking for the corresponding element in nums4. This will result in O(N**3) time complexity, which raises TLE. class Solution: def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int: from collections import Counter c = Counter(nums4) ret = 0 for n1 in nums1: for n2 in nums2: for n3 in nums3: re..
Computer Science/Coding Test 2022. 1. 16. 14:15
이전 Prev 1 Next 다음