[Leetcode] 3Sum
来源:互联网 发布:蝙蝠算法 编辑:程序博客网 时间:2024/06/06 02:08
描述
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note: The solution set must not contain duplicate triplets.
For example, given array S = [-1, 0, 1, 2, -1, -4],A solution set is:[ [-1, 0, 1], [-1, -1, 2]]
给定一个数组,找出所有的三个数的组合使得它们的和为零。
分析
这道题是之前 Two Sum 的加强版,思路也和原来的题目一样,在三元组第一个数
为了做到不重不漏,我们可以先将数组排序,同时记得判断当前的值是否重复。
代码
class Solution {public: vector<vector<int>> threeSum(vector<int>& nums) { vector<vector<int>> res; sort(nums.begin(), nums.end()); for (int k = 0; k < nums.size(); k++) { if (nums[k] > 0) break; if (k > 0 && nums[k] == nums[k - 1]) continue; int i = k + 1, j = nums.size() - 1, target = -nums[k]; while (i < j) { if (nums[i] + nums[j] == target) { res.push_back({nums[k], nums[i], nums[j]}); while (i < j && nums[i] == nums[i + 1]) i++; while (i < j && nums[j] == nums[j - 1]) j--; i++; j--; } else if (nums[i] + nums[j] < target) i++; else j--; } } return res; }};
相关问题
Two Sum
0 0
- 【Leetcode】3Sum (Sum)
- Leetcode:2Sum,3Sum
- 【Leetcode】3Sum Closest (Sum)
- leetcode 2 sum 3sum 4sum
- Leetcode 2SUM-3SUM-4SUM
- Leetcode-2sum,3sum,4sum
- leetcode 2 sum & 3 sum & 4 sum
- [LeetCode] 2Sum, 3Sum, 4Sum, 3SUm closet
- [LeetCode] K sum(2Sum、3Sum、4Sum)
- leetcode--sum集合:2sum,3sum,4sum
- leetcode --- 2 sum , 3 sum , 4 sum , k sum problem
- LeetCode: 3Sum
- LeetCode: 3 Sum Closest
- leetcode - 3 Sum
- leetcode - 3 sum closest
- leetcode 3Sum
- leetcode 3Sum Closest
- LeetCode: 3Sum
- spring通配符归纳
- linux初学<习题三>修改student的密码,别且把密码更新成“T3stlngtlme”!
- js 计算器
- Linux shell之打印命令
- Spring MVC启动过程
- [Leetcode] 3Sum
- 12-25 笔记
- homework1
- 高仿Tencent OS录音机波形动画
- js实现微博评论动态添加
- 设置UILable中的行间距和字间距以及自适应高度,段落首行挤进
- linux安装MySQL
- 创建Ajax过程
- 第四章 视频数据的压缩编码