3Sum
来源:互联网 发布:相机双重曝光软件 编辑:程序博客网 时间:2024/06/07 18:03
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]]
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(),nums.end()); vector<vector<int>> result; vector<int> temp; int i,j; int size = nums.size();//https://discuss.leetcode.com/topic/82514/runtime-error-message-reference-binding-to-null-pointer-of-type-struct-value_type/4 for(i = 0; i < size-2; i++) { if(i == 0 || (i > 0 && nums[i]!=nums[i-1])) { int head = i + 1; int tail = size - 1; int sum = 0 - nums[i]; while(head < tail) { if (nums[head] + nums[tail] == sum) { temp.clear(); temp.push_back(nums[i]); temp.push_back(nums[head]); temp.push_back(nums[tail]); result.push_back(temp); while(nums[head] == nums[head + 1] && head < tail) head++; while(nums[tail] == nums[tail - 1] && head < tail) tail--; head++; tail--; } else if(nums[head] + nums[tail] < sum ) { head++; } else tail--; } } } return result; } };
阅读全文
0 0
- 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
- Android中资源管理机制详细分析
- [转自Oracle官方技术博客]SLES12 SP2上遇到ORA-12518: TNS:listener could not hand off client connection
- QT(0):HelloWorld-程序的运行与发布
- 【项目经理之修炼(1)】《序章》关于要写给谁看的问题
- 安卓自定义Dialog
- 3Sum
- Java DecimalFormat 用法
- 学习笔记:Android ViewDragHelper的使用
- 扩展thinkphp5的redis类方法
- 变量替换扩展
- Kylin 的优化以及使用总结
- javascript作用域和执行上下文的区别
- javaPAT1021个位数统计
- zookeeper实现分布式锁服务