We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 5093ab9 commit bd0937bCopy full SHA for bd0937b
solution.py
@@ -53,13 +53,25 @@ def threesum(nums):
53
left, right = i+1, len(nums)-1
54
arr = []
55
56
- while i < len(nums) - 2:
57
- if nums[i] + nums[left] + nums[right] == 0:
58
- res = [nums[i], nums[left], nums[right]]
59
- arr.append(res)
60
- i += 1
61
- left += 1
62
- right -= 1
+ # while i < len(nums) - 2:
+ # if nums[i] + nums[left] + nums[right] == 0:
+ # res = [nums[i], nums[left], nums[right]]
+ # arr.append(res)
+ # i += 1
+ # left += 1
+ # right -= 1
63
+
64
+ for i in nums:
65
+ for j in nums:
66
+ if nums[i] + nums[left] + nums[right] == 0:
67
+ res = [nums[i], nums[left], nums[right]]
68
+ arr.append(res)
69
+ i += 1
70
+ left += 1
71
+ right -= 1
72
73
74
75
76
77
0 commit comments