3Sum
来源:互联网 发布:js 获取日期最后一天 编辑:程序博客网 时间:2024/03/29 21:48
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:
- 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)
class Solution {public: vector<vector<int> > threeSum(vector<int> &num) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<vector<int> > result; set<vector<int> > record; if (num.size() < 3) { return result; } sort(num.begin(), num.end()); vector<int> got; int sum = 0; for (int i = 0; i < num.size() - 2; ++i) { int low = i + 1; int high = num.size() - 1; while (low < high) { sum = num[i] + num[low] + num[high]; if (sum == 0) { got.push_back(num[i]); got.push_back(num[low]); got.push_back(num[high]); if (record.find(got) == record.end()) { record.insert(got); result.push_back(got); } got.clear(); --high; } else if (sum > 0) { --high; } else { ++low; } } } return result; }};
- Two Sum && 3 Sum
- 【Leetcode】3Sum (Sum)
- 3Sum 3Sum Closest 4Sum
- 3Sum & 3Sum Closest & 4Sum
- 3sum、3Sum closet、 4sum
- 3Sum, 3Sum Closest, 4 Sum
- leetcode 2 sum 3sum 4sum
- 2Sum 3Sum 4Sum
- Leetcode 2SUM-3SUM-4SUM
- Leetcode-2sum,3sum,4sum
- leetcode 2 sum & 3 sum & 4 sum
- 3Sum
- 3SUM
- 3-sum
- 3Sum
- 3Sum
- 3Sum
- 3Sum
- c# activeMQ使用
- TinyXML应用例子
- 信息系统项目管理师案例分析万金油
- listView中按钮等组件的监听
- IOS学习笔记2—Objective C—类、属性、方法
- 3Sum
- ARM处理器的Cache之cortex a8
- SQL事务,只要有一条更新语句受影响行数为0则rollback
- POJ 1151 Atlantis 扫描线+离散化+线段树
- 深度探索C++对象模型笔记(二)
- [bzoj1269][AHOI2006]文本编辑器editort
- 常见命令
- (3)承载和运行基本的 wcf 服务
- Posix线程编程指南(1)