leetcode - 3Sum
2013-03-03 19:29
302 查看
题目描述:点击此处
完毕。
#include <iostream> #include <vector> using namespace std; class Solution { public: vector<vector<int> > threeSum(vector<int> &num) { vector<vector<int> > result; sort(num.begin(),num.end()); vector<int> entry; entry.assign(3,-1000); vector<int>::iterator i ,j ,k; for (i=num.begin();i<num.end();i++){ if (i>num.begin() && *i==*(i-1)) continue; j = i+1; k = num.end()-1; while (j<k){ int sum = *i+*j+*k; if (sum>0) k--; else if (sum<0) j++; else { if (*j!=entry[1]||*k!=entry[2]){ entry[0]=*i; entry[1]=*j; entry[2] = *k; result.push_back(entry); } k--; j++; } } } return result; } };
完毕。
相关文章推荐
- leetcode 15. 3Sum
- leetcode 3Sum
- leetcode-3sum
- 3Sum-LeetCode
- leetcode16. 3Sum Closest
- 3Sum —— Leetcode
- leetcode15~3Sum
- LeetCode:3Sum Closest
- LeetCode 3Sum
- [leetcode] 3Sum
- leetcode16. 3Sum Closest
- LeetCode 16 3sum closest
- LeetCode[Array]----3Sum Closest
- 《leetCode》:3Sum Closest
- leetcode 15. 3Sum
- [Leetcode]3Sum Closest
- [LeetCode1]3Sum
- LeetCode 3Sum Closest
- Leetcode-3Sum
- leetcode-16-3Sum Closest