Commit bef9603

committed

update: 18

1 parent d8a09ed commit bef9603Copy full SHA for bef9603

File tree

+45

-0

lines changed

+45

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,6 +22,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`22`	`22`	`\| 15 \| [3Sum](https://leetcode.com/problems/3sum/) \| [JavaScript](./src/3sum/res.js) \| Medium \|`
`23`	`23`	`\| 16 \| [3Sum Closest](https://leetcode.com/problems/3sum-closest/) \| [JavaScript](./src/3sum-closest/res.js) \| Medium \|`
`24`	`24`	`\| 17 \| [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) \| [JavaScript](./src/letter-combinations-of-a-phone-number/res.js) \| Medium \|`
	`25`	`+\| 18 \| [4sum](https://leetcode.com/problems/4sum/) \| [TypeScript](./src/4sum/res.ts) \| Medium \|`
`25`	`26`	`\| 19 \| [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) \| [JavaScript](./src/remove-nth-node-from-end-of-list/res.js) \| Medium \|`
`26`	`27`	`\| 20 \| [valid-parentheses](https://leetcode.com/problems/valid-parentheses/) \| [TypeScript](./src/valid-parentheses/res.ts) \| Easy \|`
`27`	`28`	`\| 22 \| [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) \| [JavaScript](./src/generate-parentheses/res.js) \| Medium \|`

Lines changed: 44 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,44 @@`
	`1`	`+function fourSum(nums: number[], target: number): number[][] {`
	`2`	`+ const res: number[][] = [];`
	`3`	`+`
	`4`	`+ if (nums.length < 4) {`
	`5`	`+ return res;`
	`6`	`+ }`
	`7`	`+`
	`8`	`+ nums.sort((a, b) => a - b);`
	`9`	`+`
	`10`	`+ for (let i = 0; i < nums.length-3; i++) {`
	`11`	`+ if (i-1 >=0 && nums[i] === nums[i-1]) {`
	`12`	`+ continue;`
	`13`	`+ }`
	`14`	`+ for (let j = i+1; j < nums.length-2; j++) {`
	`15`	`+ if (j > i+1 && nums[j] === nums[j-1]) {`
	`16`	`+ continue;`
	`17`	`+ }`
	`18`	`+`
	`19`	`+ let k = j+1, l = nums.length-1;`
	`20`	`+ while (k < l) {`
	`21`	`+ const sum = nums[i] + nums[j] + nums[k] + nums[l];`
	`22`	`+`
	`23`	`+ if (sum === target) {`
	`24`	`+ res.push([nums[i], nums[j], nums[k], nums[l]]);`
	`25`	`+`
	`26`	`+ while (k < l && nums[k] === nums[k+1]) {`
	`27`	`+ k++;`
	`28`	`+ }`
	`29`	`+ while (k < l && nums[l] === nums[l-1]) {`
	`30`	`+ l--;`
	`31`	`+ }`
	`32`	`+ k++;`
	`33`	`+ l--;`
	`34`	`+ } else if (sum < target) {`
	`35`	`+ k++;`
	`36`	`+ } else if (sum > target) {`
	`37`	`+ l--;`
	`38`	`+ }`
	`39`	`+ }`
	`40`	`+ }`
	`41`	`+ }`
	`42`	`+`
	`43`	`+ return res;`
	`44`	`+};`

Comments

(0)