Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitb97ccc9

Browse files
authored
Merge pull requestneetcode-gh#1899 from andynullwong/0018
Create 0018-4sum.js & .ts
2 parents75aac3b +7b0cfd2 commitb97ccc9

File tree

2 files changed

+91
-0
lines changed

2 files changed

+91
-0
lines changed

‎javascript/0018-4sum.js‎

Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
/**
2+
*@param {number[]} nums
3+
*@param {number} target
4+
*@return {number[][]}
5+
*/
6+
varfourSum=function(nums,target){
7+
constsortedNums=nums.sort((a,b)=>a-b);
8+
constres=[];
9+
constquad=[];
10+
11+
constkSum=(k,start,target)=>{
12+
if(k>2){
13+
for(leti=start;i<sortedNums.length;i++){
14+
if(i!==start&&sortedNums[i]===sortedNums[i-1]){
15+
continue;
16+
}
17+
quad.push(sortedNums[i]);
18+
kSum(k-1,i+1,target-sortedNums[i]);
19+
quad.pop();
20+
}
21+
}else{
22+
letleft=start;
23+
letright=sortedNums.length-1;
24+
25+
while(left<right){
26+
constsum=sortedNums[left]+sortedNums[right];
27+
if(sum<target){
28+
left++;
29+
}elseif(sum>target){
30+
right--;
31+
}else{
32+
res.push(
33+
quad.concat([sortedNums[left],sortedNums[right]])
34+
);
35+
left++;
36+
while(
37+
left<right&&
38+
sortedNums[left]===sortedNums[left-1]
39+
){
40+
left++;
41+
}
42+
}
43+
}
44+
}
45+
};
46+
kSum(4,0,target);
47+
returnres;
48+
};

‎typescript/0018-4sum.ts‎

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
functionfourSum(nums:number[],target:number):number[][]{
2+
constsortedNums:number[]=nums.sort((a:number,b:number)=>a-b);
3+
constres:number[][]=[];
4+
constquad:number[]=[];
5+
6+
constkSum=(k:number,start:number,target:number):void=>{
7+
if(k>2){
8+
for(leti=start;i<sortedNums.length;i++){
9+
if(i!==start&&sortedNums[i]===sortedNums[i-1]){
10+
continue;
11+
}
12+
quad.push(sortedNums[i]);
13+
kSum(k-1,i+1,target-sortedNums[i]);
14+
quad.pop();
15+
}
16+
}else{
17+
letleft:number=start;
18+
letright:number=sortedNums.length-1;
19+
20+
while(left<right){
21+
constsum=sortedNums[left]+sortedNums[right];
22+
if(sum<target){
23+
left++;
24+
}elseif(sum>target){
25+
right--;
26+
}else{
27+
res.push(
28+
quad.concat([sortedNums[left],sortedNums[right]])
29+
);
30+
left++;
31+
while(
32+
left<right&&
33+
sortedNums[left]===sortedNums[left-1]
34+
){
35+
left++;
36+
}
37+
}
38+
}
39+
}
40+
};
41+
kSum(4,0,target);
42+
returnres;
43+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp