001TwoSum

001TwoSum

目录

做什么事情都不完，现在要大四了，重新拾起算法数据结构，从leetcode开始。

• vector用法
• map用法

题目内容

==

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)暴力用脚想想都不可以。
网上有java，O(n)的方法。

我的代码：

---

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int , int> hmap;
        vector<int> ans;
        int tmp,i,r;
        for (i = 0; i < nums.size(); i++)
        {
            tmp = hmap.count(target-nums[i]);
//          r = hmap[target-nums[i]];
            if(tmp == 0)  //如果没有对应的就将本次的加入map
            {
                if(!hmap.count(nums[i]))
                    hmap.insert(pair<int, int>(nums[i],i+1));
            }
            else
            {
                ans.push_back(hmap[target-nums[i]]);
                ans.push_back(i+1);
                return ans;
            }
        }
        return ans;
    }
};

小记

map：
map.count() 查找对应键的数目
map.insert(pair<int,int>(para1,para2)) 插入一组数字
vector：
插入用push_back,插入到最后。