LeetCode twoSum
来源:互联网 发布:淘宝总公司投诉电话 编辑:程序博客网 时间:2024/05/01 14:47
class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
unordered_map<int,queue<int>> myMap;
vector<int> result;
for(int i = 0; i < numbers.size(); i++)
myMap[numbers[i]].push(i+1);
for(int i = 0; i < numbers.size(); i++) {
int first = myMap[numbers[i]].front();
myMap[numbers[i]].pop();
int value = target - numbers[i];
if(myMap.find(value) != myMap.end() && myMap[value].size()) {
int second = myMap[value].front();
if(second <= first) {
int temp;
temp = first;
first = second;
second = temp;
}
result.push_back(first);
result.push_back(second);
break;
}
}
return result;
}
};
public:
vector<int> twoSum(vector<int> &numbers, int target) {
unordered_map<int,queue<int>> myMap;
vector<int> result;
for(int i = 0; i < numbers.size(); i++)
myMap[numbers[i]].push(i+1);
for(int i = 0; i < numbers.size(); i++) {
int first = myMap[numbers[i]].front();
myMap[numbers[i]].pop();
int value = target - numbers[i];
if(myMap.find(value) != myMap.end() && myMap[value].size()) {
int second = myMap[value].front();
if(second <= first) {
int temp;
temp = first;
first = second;
second = temp;
}
result.push_back(first);
result.push_back(second);
break;
}
}
return result;
}
};
0 0
- [leetcode]-twoSum
- [leetcode]twoSum
- LeetCode-TwoSum
- 【Leetcode】TwoSum
- LeetCode - TwoSum
- leetcode :twoSum
- leetcode TwoSum
- leetcode twosum
- leetcode--twoSum
- LeetCode twoSum
- LeetCode-TwoSum
- leetcode--twoSum
- leetcode TwoSum
- TwoSum leetcode
- leetcode:twosum
- leetcode:TwoSum
- LeetCode---TwoSum
- LeetCode-TwoSum
- metasploit - meterpreter commands (linux)
- shell脚本编程(快速排序)
- 15.精灵进阶之给节点添加动作
- R语言中的并行计算——二、搭建R的集群
- SQL Server 损坏修复
- LeetCode twoSum
- Java垃圾回收是如何工作的?
- Objective-C - 模型的设计
- Distinctive Image Features from Scale-Invariant Keypoints-SIFT算法译文
- Android环境搭建 目录介绍
- Object类中的方法
- IOS7开发~JavaScriptCore (一)
- 自定义标签工具栏
- New files creation and Makefile