Commit f186090

author

scuyjzh

committed

modify solutions to problem - "15. 3Sum"

1 parent 04a931c commit f186090Copy full SHA for f186090

File tree

2 files changed

-10

lines changed

README.md
src/com/scuyjzh/leetcode/medium/No_0015_3Sum
- Solution.java

2 files changed

-10

lines changed

`‎README.md‎`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -219,6 +219,7 @@`
`219`	`219`	`\| ---- \| ------------------------------------------------------------ \| ------------------------------------------------------------ \| ---- \| -------------------- \|`
`220`	`220`	`\| 11 \| [盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/) \| [Java](./src/com/scuyjzh/leetcode/medium/No_0011_Container_With_Most_Water/Solution.java) \| 中等 \| 贪心数组双指针 \|`
`221`	`221`	`\| 167 \| [两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/) \| [Java](./src/com/scuyjzh/leetcode/medium/No_0167_Two_Sum_II/Solution.java) \| 中等 \| 数组双指针二分查找 \|`
	`222`	`+\| 15 \| [三数之和](https://leetcode-cn.com/problems/3sum/) \| [Java](./src/com/scuyjzh/leetcode/medium/No_0015_3Sum/Solution.java) \| 中等 \| 数组双指针排序 \|`
`222`	`223`
`223`	`224`	`### Array`
`224`	`225`

`‎src/com/scuyjzh/leetcode/medium/No_0015_3Sum/Solution.java‎`

Lines changed: 8 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,14 +7,12 @@`
`7`	`7`	`*`
`8`	`8`	`* 给你一个包含 n 个整数的数组nums,判断nums中是否存在三个元素`
`9`	`9`	`* a,b,c ,使得a + b + c = 0 ?请你找出所有和为 0 且不重复的三元组。`
	`10`	`+ *`
`10`	`11`	`* 注意:答案中不可以包含重复的三元组。`
`11`	`12`	`*/`
`12`	`13`	`class Solution {`
`13`	`14`	`/**`
`14`	`15`	`* 方法:排序 + 双指针`
`15`		`- *`
`16`		`- * • 时间复杂度:O(N^2),其中 N 是数组 nums 的长度。`
`17`		`- * • 空间复杂度:O(logN)。忽略存储答案的空间,额外的排序的空间复杂度为 O(logN)。`
`18`	`16`	`*/`
`19`	`17`	`public List<List<Integer>> threeSum(int[] nums) {`
`20`	`18`	`List<List<Integer>> res = new LinkedList<>();`
`@@ -24,7 +22,7 @@ public List<List<Integer>> threeSum(int[] nums) {`
`24`	`22`	`// 排序`
`25`	`23`	`Arrays.sort(nums);`
`26`	`24`	`for (int i = 0; i < nums.length - 2; ++i) {`
`27`		`- // 如果当前数字大于0,则三数之和一定大于0,所以结束循环`
	`25`	`+ // 如果当前数字大于 0,则三数之和一定大于 0,所以结束循环`
`28`	`26`	`if (nums[i] > 0) {`
`29`	`27`	`break;`
`30`	`28`	`}`
`@@ -37,19 +35,19 @@ public List<List<Integer>> threeSum(int[] nums) {`
`37`	`35`	`int sum = nums[i] + nums[left] + nums[right];`
`38`	`36`	`if (0 == sum) {`
`39`	`37`	`res.add(Arrays.asList(nums[i], nums[left], nums[right]));`
`40`		`- left++;`
`41`		`- right--;`
	`38`	`+ ++left;`
	`39`	`+ --right;`
`42`	`40`	`// 去除重复解`
`43`	`41`	`while (left < right && nums[left] == nums[left - 1]) {`
`44`		`- left++;`
	`42`	`+ ++left;`
`45`	`43`	`}`
`46`	`44`	`while (left < right && nums[right] == nums[right + 1]) {`
`47`		`- right--;`
	`45`	`+ --right;`
`48`	`46`	`}`
`49`	`47`	`} else if (sum < 0) {`
`50`		`- left++;`
	`48`	`+ ++left;`
`51`	`49`	`} else {`
`52`		`- right--;`
	`50`	`+ --right;`
`53`	`51`	`}`
`54`	`52`	`}`
`55`	`53`	`}`

0 commit comments

Comments

(0)

Navigation Menu

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

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit f186090

File tree

2 files changed

2 files changed

`‎README.md‎`

`‎src/com/scuyjzh/leetcode/medium/No_0015_3Sum/Solution.java‎`

0 commit comments