Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
56 changes: 35 additions & 21 deletions solutions/python/practice224.py
Original file line number Diff line number Diff line change
@@ -1,28 +1,42 @@
# Problem: 4Sum
# Source: https://leetcode.com/problems/4sum/
# Note: Finds all unique quadruplets whose elements sum to the given target using four nested loops.
# Status: In Progress (Not accepted solution)
# Note: Sort, fix two values, then find the remaining pair with two pointers.
# Status: ✅ Done


class Solution(object):
def fourSum(self, nums, target):
res = []
nums.sort()
for i in range(len(nums) - 3):
for j in range(i + 1, len(nums) - 2):
for k in range(j + 1, len(nums) - 1):
for n in range(k + 1, len(nums)):
if sum([nums[i], nums[k], nums[j], nums[n]]) == target:
res.append([nums[i], nums[k], nums[j], nums[n]])

final = []

for lst in res:
if final and lst in final:
nums = sorted(nums)
result = []
size = len(nums)
for first in range(size - 3):
if first > 0 and nums[first] == nums[first - 1]:
continue
final.append(lst)
for second in range(first + 1, size - 2):
if second > first + 1 and nums[second] == nums[second - 1]:
continue
left, right = second + 1, size - 1
while left < right:
total = nums[first] + nums[second] + nums[left] + nums[right]
if total < target:
left += 1
elif total > target:
right -= 1
else:
result.append([nums[first], nums[second], nums[left], nums[right]])
left += 1
right -= 1
while left < right and nums[left] == nums[left - 1]:
left += 1
while left < right and nums[right] == nums[right + 1]:
right -= 1
return result

return final

s = Solution()
print(s.fourSum([1, 0, -1, 0, -2, 2], 0)) # [[-2, -1, 1, 2], [-2, 0, 0, 2], [-1, 0, 0, 1]]
print(s.fourSum([2, 2, 2, 2, 2], 8)) # [[2, 2, 2, 2]]
print(s.fourSum([0, 0, 0, 0], 0)) # [[0, 0, 0, 0]]
if __name__ == "__main__":
solution = Solution()
assert solution.fourSum([1, 0, -1, 0, -2, 2], 0) == [
[-2, -1, 1, 2], [-2, 0, 0, 2], [-1, 0, 0, 1],
]
assert solution.fourSum([2, 2, 2, 2, 2], 8) == [[2, 2, 2, 2]]
assert solution.fourSum([0, 0, 0, 0], 0) == [[0, 0, 0, 0]]
Loading