Leetcode--3Sum
来源:互联网 发布:vb打印字符串 编辑:程序博客网 时间:2024/05/16 16:04
Problem Description:
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)解法:注意不能输出重复子集,因此代码中用到upper_bound()函数找到下一个不重复的数,代码如下:
class Solution {public: vector<vector<int> > threeSum(vector<int> &num) { vector<vector<int> > results; if(num.size()<3) return results; vector<int> subset; sort(num.begin(),num.end()); vector<int>::iterator p=num.begin(),q,flag; while(p<(num.end()-2)) { q=p+1; while(q<num.end()-1) { int tag=0-*p-*q; if(find(q+1,num.end(),tag)!=num.end()) { flag=find(q+1,num.end(),tag); subset.push_back(*p); subset.push_back(*q); subset.push_back(*flag); results.push_back(subset); } subset.clear(); q=upper_bound(q,num.end()-1,*q); } p=upper_bound(p,num.end()-2,*p); } return results; }};
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
- 001_024 Python 让某些字符串大小写不敏感 如比较和查询不敏感 其他敏感
- 分页代码及用法
- R语言学习笔记——读 bigmemory 文档
- UDP中的Connect
- 哈夫曼编码压缩,解压,压缩比,编码表,储存到文件
- Leetcode--3Sum
- sed awk grep 正则表达式
- 算法概论 思维导图
- 如何在GitHub使用高亮语法
- 排列组合 从n个自然数中取出r个数的组合
- QT开发之旅四邮件发送工具
- Spring学习
- Web前端开发十日谈
- struts2入门