15.3Sum
来源:互联网 发布:面板数据回归模型 编辑:程序博客网 时间:2024/06/06 16:32
3Sum
Total Accepted: 48978 Total Submissions: 290298My SubmissionsGiven 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:
- Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
- 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)
Have you met this question in a real interview?
Yes
No
Discuss
class Solution {
public:vector<vector<int> > threeSum(vector<int> &num) {
int N = num.size();
vector<vector<int>> res;
if (N<3) return res;//判错
sort(num.begin(), num.end());//数组排序
//遍历第一个数,剩下两个数用双指针判断
for (int i = 0; i<N - 2; ++i){
int left = i + 1, right = N - 1;
if (num[i]>0) break;//优化
while (left<right){
if (num[i] + num[left]>0 || num[right] < 0) break;//优化
if ((num[i] + num[left] + num[right]) == 0){
res.push_back(vector<int>({ num[i], num[left], num[right] }));
//去重
while(left<right&&num[left]==num[left+1]){
++left;
}
++left;
while(i<N&&num[i]==num[i+1]){
++i;
}
}else if (num[i] + num[left] + num[right]>0){
--right;
}else{
++left;
}
}
}
return res;
}
};
0 0
- 15.3Sum
- 15.3Sum
- 15.3sum
- 15.3Sum
- 15.3Sum
- 15.3Sum
- 15.3Sum
- 15.3 Sum
- 15.3Sum
- 15.3Sum &16.3Sum Closest
- [LeetCode]15.3Sum
- LeetCode 15.3Sum
- Algorithms—15.3Sum
- [Leetcode] 15.3Sum @python
- LeetCode-15.3Sum
- Leetcode||15.3Sum
- 15.3sum leetcode(array)
- [LeetCode]15.3Sum
- Ubuntu 14.04安装openwrt
- 获取文件夹下所有文件【MFC方法】
- $(document).ready(function()
- U8SDK问答及汇总
- JAVA中的四个访问修饰符(By 独立的综合体)
- 15.3Sum
- 分析复制文件,在复制过程中更改文件后缀名
- this.getServletContext().getRealPath("/"); 是什么意思
- 同态滤波器
- c语言中文件结束符占得字节数
- C语言 为下面的函数原型编写函数定义:int ascii_to_integer(char *str)
- 详谈单链表的有关操作集锦~
- C++ 异常
- IO流体系图解