leet code. 15. 3Sum (暴力???)
来源:互联网 发布:彩票计划软件 源代码 编辑:程序博客网 时间:2024/05/16 16: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) { vector<vector<int>> ans; sort(nums.begin(), nums.end()); for (int i = 0; i < nums.size(); ++i) { int num = nums[i]; if (num == nums[i - 1] && i > 0) continue; int left = i + 1; int right = nums.size() - 1; while (left < right) { //cout << left << " " << right << endl; if (num + nums[left] + nums[right] < 0) { left++; while (nums[left] == nums[left - 1] && left < right) left++; } else if (num + nums[left] + nums[right] > 0) { right--; while (nums[right] == nums[right + 1] && left < right) right--; } else { ans.push_back({num, nums[left], nums[right]}); left++; while (nums[left] == nums[left - 1] && left < right) left++; } } } return ans;}
阅读全文
0 0
- leet code. 15. 3Sum (暴力???)
- [leet code] 3Sum Closest
- Leet Code OJ 15. 3Sum[Difficulty: Medium]
- Leet Code OJ 15. 3Sum[Difficulty: Medium]
- Leet Code Medium 15 3Sum
- Leet Code Medium 16 3Sum Closest
- [leet code] Path Sum
- [leet code] Combination Sum
- [Leet Code] 4sum
- [leet code] Minimum Path Sum
- [leet code] Path Sum II
- Permutations(Leet Code)
- [leet code] Sum Root to Leaf Numbers
- Leet Code Medium 1 two sum
- Leet Code Medium 18 4Sum
- 【Leet Code】64. Minimum Path Sum---Medium
- 【Leet Code- Algorithm】【1-Two Sum】【Python】
- Binary Tree Maximum Path Sum[leet code test cases passed]
- dp-最长公共子序列
- 函数声明的几种方式,函数声明与函数表达式的区别,函数调用的几种方式
- iOS证书说明和发布内购流程整理及 证书申请
- Jmeter测试登录接口时密码RSA加密如何处理
- 设计模式--适配器模式
- leet code. 15. 3Sum (暴力???)
- snmp在Centos 7中安装
- 10.内部类
- 关于锁的理解
- git tag教程
- 【HUSTOJ】1092: 马鞍数
- Java多线程学习
- LightOJ
- Gym