-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path018.js
More file actions
89 lines (77 loc) · 2.41 KB
/
Copy path018.js
File metadata and controls
89 lines (77 loc) · 2.41 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
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
//与15类似,给定一个数组找出其中的四元数组的和值等于target的所有组合
/**
* @param {number[]} nums
* @param {number} target
* @return {number[][]}
*/
var fourSum = function (nums, target) {
var res = [];
var len = nums.length;
if (nums === null || len < 4) return res;
function compare(value1, value2) {
if (value1 > value2) {
return 1;
} else if (value1 < value2) {
return -1;
} else {
return 0;
}
}
nums.sort(compare);
//具体的做法是将四元数组的组合分解成三元以至于二元
var max = nums[len - 1];
if (4 * nums[0] > target || 4 * max < target) return res;
var i, z;
for (i = 0; i < len; i++) {
z = nums[i];
if (i > 0 && z === nums[i - 1]) continue;
if (z + 3 * max < target) continue;
if (4 * z > target) break;
if (4 * z === target) {
if (i + 3 < len && nums[i + 3] === z) {
res.push(new Array(z, z, z, z));
}
break;
}
threeSumForfourSum(nums, target - z, i + 1, len - 1, res, z);
}
return res;
};
function threeSumForfourSum(nums, target, low, high, fourSumList, z1) {
if (low + 1 >= high) return;
var max = nums[high];
if (3 * nums[low] > target || 3 * max < target) return;
var i, z;
for (i = low; i < high - 1; i++) {
z = nums[i];
if (i > low && z == nums[i - 1]) continue;
if (z + 2 * max < target) continue;
if (3 * z > target) break;
if (3 * z == target) {
if (i + 1 < high && nums[i + 2] == z) {
fourSumList.push(new Array(z1, z, z, z));
}
break;
}
twoSumForFourSum(nums, target - z, i + 1, high, fourSumList, z1, z);
}
}
function twoSumForFourSum(nums, target, low, high, fourSumList, z1, z2) {
if (low >= high) return;
if (2 * nums[low] > target || 2 * nums[high] < target) return;
var i = low, j = high, sum, x;
while (i < j) {
sum = nums[i] + nums[j];
if (sum == target) {
fourSumList.push(new Array(z1, z2, nums[i], nums[j]));
x = nums[i];
while (++i < j && x == nums[i])
;
x = nums[j];
while (i < --j && x == nums[j])
;
}
if (sum < target) i++;
if (sum > target) j--;
}
}