forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdoitduri.swift
More file actions
43 lines (33 loc) · 1.36 KB
/
doitduri.swift
File metadata and controls
43 lines (33 loc) · 1.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
import Foundation
class Solution {
func threeSum(_ nums: [Int]) -> [[Int]] {
var result = [[Int]]()
let sortedNums = nums.sorted()
for i in 0..<sortedNums.count - 2 {
if i > 0 && sortedNums[i] == sortedNums[i - 1] {
continue
}
var leftNumber = i + 1
var rightNumber = sortedNums.count - 1
while leftNumber < rightNumber {
let sum = sortedNums[i] + sortedNums[leftNumber] + sortedNums[rightNumber]
if sum < 0 {
leftNumber += 1
} else if sum > 0 {
rightNumber -= 1
} else {
result.append([sortedNums[i], sortedNums[leftNumber], sortedNums[rightNumber]])
while leftNumber < rightNumber && sortedNums[leftNumber] == sortedNums[leftNumber + 1] {
leftNumber += 1
}
while leftNumber < rightNumber && sortedNums[rightNumber] == sortedNums[rightNumber - 1] {
rightNumber -= 1
}
leftNumber += 1
rightNumber -= 1
}
}
}
return result
}
}