TwoSum
来源:互联网 发布:萨尔曼.可汗 知乎 编辑:程序博客网 时间:2024/05/04 15:06
题目:
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
解法:第一个方法是二级遍历,算法复杂度是O(n^2)
代码如下:
vector<int> twoSum(vector<int> &numbers, int target){ vector <int> results; int j, i; for (i = 0; i <numbers.size()-1;i++) for (j = i + 1; j < numbers.size(); j++) if (numbers[j]+numbers[i]==target){ results.push_back(i+1); results.push_back(j+1); } return results;}O(n^2)算法复杂度的肯定是不能满足需求的:
因此考虑用哈希表来实现,直接用C++中的map关联容器。
其代码如下:
vector<int> twoSum(vector<int> &numbers, int target){vector <int>results;map<int, int>hmap;int i;for (i = 0; i < numbers.size(); i++){if (!hmap.count(numbers[i]))hmap.insert(pair<int, int>(numbers[i], i+1));//对MAP初始化}for (i = 0; i < numbers.size(); i++){//cout << "a" << endl;if (hmap.count(target - numbers[i]))if( (i + 1)<(hmap[target - numbers[i]])){results.push_back(i + 1);results.push_back(hmap[target - numbers[i]]);}}return results;}通过这个题,学习到对vector容器和map关联容器的操作,
0 0
- twoSum
- TwoSum
- TwoSum
- TwoSum
- twoSum
- TwoSum
- TwoSum
- TwoSum
- TwoSum
- TwoSum
- twoSum
- TwoSum
- twoSum
- TwoSum
- TwoSum
- twosum
- TwoSum
- TwoSum
- Fragment详解
- PHP基础之使用SimpleXML解析xml
- 利用OpenGL模板缓冲,从正方形中抠出一个圆形边框
- Knockout应用开发指南 第一章:入门
- 01背包***hihocoder
- TwoSum
- 通过 GitHub Pages 建立个人站点(详细步骤)
- InputStream的read方法读取字节不完全的问题
- Android开发:文字描边
- Applications using Launch Screen Files and targetting iOS 7.1 and earlier
- Android 引导界面的实现过程
- ERP软件市场占有率(2012/2013)
- 快排分区函数
- MX4找不见设备解决办法!!!