問題描述：

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

?

class Solution { public:vector<int> twoSum(vector<int> &numbers, int target) {unordered_map<int,int> datamap; vector<int> result;for(int i=0;i<numbers.size();i++){datamap[numbers[i]]=i; }for(int i=0;i<numbers.size();i++){int gap=target-numbers[i];if(datamap.find(gap)!=datamap.end()&&datamap[gap]!=i){result.push_back(i+1);result.push_back(datamap[gap]+1);break;}}return result;} };

　

轉載于:https://www.cnblogs.com/xiaoying1245970347/p/4550176.html

總結

以上是生活随笔為你收集整理的LeetCode:Two Sum的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。