【LeetNode2-1-7】Two sum--C++源代码(VS2015)
来源:互联网 发布:怎么拿到网站数据库 编辑:程序博客网 时间:2024/06/06 05:37
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
/*
Two sum
*/
vector<int> Solution(vector<int> &vec, int target)
{
unordered_map<int, int> Sum;
for (int i = 0; i < vec.size(); i++)
{
Sum[vec[i]] = i;
}
vector<int> result;
for (int i = 0; i < vec.size(); i++)
{
int gap = target - vec[i];
if (Sum.find(gap) != Sum.end() && Sum[gap] > i)
{
result.push_back(i);
result.push_back(Sum[gap]);
break;
}
}
return result;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
vector<int> vec(&arr[0], &arr[10]);
vector<int> result;
result = Solution(vec, 19);
cout << "index1 = " << result[0] << ", index2 = " << result[1] << endl;
system("pause");
return 0;
}
#include <unordered_map>
#include <vector>
using namespace std;
/*
Two sum
*/
vector<int> Solution(vector<int> &vec, int target)
{
unordered_map<int, int> Sum;
for (int i = 0; i < vec.size(); i++)
{
Sum[vec[i]] = i;
}
vector<int> result;
for (int i = 0; i < vec.size(); i++)
{
int gap = target - vec[i];
if (Sum.find(gap) != Sum.end() && Sum[gap] > i)
{
result.push_back(i);
result.push_back(Sum[gap]);
break;
}
}
return result;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
vector<int> vec(&arr[0], &arr[10]);
vector<int> result;
result = Solution(vec, 19);
cout << "index1 = " << result[0] << ", index2 = " << result[1] << endl;
system("pause");
return 0;
}
阅读全文
0 0
- 【LeetNode2-1-7】Two sum--C++源代码(VS2015)
- 【LeetNode2-1-8】Three sum--C++源代码(VS2015)
- 【LeetNode2-1-9】Three sum closest--C++源代码(VS2015)
- 【LeetNode2-1-10】Four sum--C++源代码(VS2015)
- 【LeetNode2-1-5】Median of two sorted arrays--C++源代码(VS2015)
- 【LeetNode2-1-6】Longest consecutive sequence--C++源代码(VS2015)
- 【LeetNode2-1-1】Remove duplicates from sorted array I--C++源代码(VS2015)
- 【LeetNode2-1-2】Remove duplicates from sorted array II--C++源代码(VS2015)
- 【LeetNode2-1-3】Search in rotated sorted array I--C++源代码(VS2015)
- 【LeetNode2-1-4】Search in rotated sorted array II--C++源代码(VS2015)
- Leetcode[1] Two Sum (c++)
- [1, Medium, C++] Two Sum
- [LeetCode#1][C]Two Sum
- 【LeetCode-1】 Two Sum(C++)
- [LeetCode]1 Two Sum(C++,Python实现)
- leetcode 1:two sum(C语言)
- [C语言][LeetCode][1]Two Sum
- 1---LeetCode【Two Sum】|C语言|总结
- 1134. Vertex Cover (25)
- Secret Origins
- 安卓开发-ListView的适配器和监听器/ExpandableListView的使用
- Android 试题滑动刻度尺--自定义View
- c#调用C/C++代码时出现的PInvokeStackImbalance异常实例及解决方式
- 【LeetNode2-1-7】Two sum--C++源代码(VS2015)
- MongodbTemplate的增删改操作
- [LeetCode] 19. Remove Nth Node From End of List
- 2017/10/05 明天就回去了..
- HDU
- 二.像素操作
- 百度地图学习总结(2)—我爱北京天安门,Hello-BaiduMap
- java正则表达式的使用-抓取百度搜索的结果
- 2009年的人民币1000元购买力,相当于30年前人民币多少钱?