/
15.3-sum.php
96 lines (78 loc) · 2.42 KB
/
15.3-sum.php
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
<?php
namespace LeetCode\ThreeSum;
require __DIR__ . '/vendor/autoload.php';
/*
* @lc app=leetcode id=15 lang=php
*
* [15] 3Sum
*/
// @lc code=start
class Solution
{
/**
* @param int[] $nums
* @return int[][]
*/
public function threeSum($nums)
{
$answer = [];
$length = count($nums);
if ($length < 3) {
return $answer;
}
sort($nums);
for ($i = 0; $i < $length - 2; $i++) {
if ($i != 0 && $nums[$i - 1] == $nums[$i]) {
continue;
}
$windowLeft = $i + 1;
$windowRight = $length - 1;
while ($windowLeft < $windowRight) {
if ($nums[$i] + $nums[$windowLeft] + $nums[$windowRight] == 0) {
$answer[] = [$nums[$i], $nums[$windowLeft], $nums[$windowRight]];
$windowLeft++;
while (
$windowLeft < $windowRight &&
$nums[$windowLeft - 1] == $nums[$windowLeft]
) {
$windowLeft++;
}
$windowRight--;
while (
$windowLeft < $windowRight &&
$nums[$windowRight + 1] == $nums[$windowRight]
) {
$windowRight--;
}
}
if ($nums[$i] + $nums[$windowLeft] + $nums[$windowRight] < 0) {
$windowLeft++;
while (
$windowLeft < $windowRight &&
$nums[$windowLeft] == $nums[$windowLeft - 1]
) {
$windowLeft++;
continue;
}
continue;
}
if ($nums[$i] + $nums[$windowLeft] + $nums[$windowRight] > 0) {
$windowRight--;
while (
$windowLeft < $windowRight &&
$nums[$windowRight] == $nums[$windowRight + 1]
) {
$windowRight--;
continue;
}
continue;
}
}
}
return $answer;
}
}
// @lc code=end
// $Solution = new Solution();
// $answer = $Solution->threeSum([-3, -2, -2, 0, 0]);
// dump($answer);