疯狂刷力扣

两数之和

用的hashmap

count函数确定key是否存在 存在返回1，否则是0

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector <int> sum(2,-1);
        unordered_map<int,int> a;
        for(int i=0;i<nums.size();i++){
            if(a.count(target-nums[i])){
                sum[0]=i;
                sum[1]=a[target-nums[i]];
                break;
            }
            a[nums[i]]=i;
        }
        return sum;
    }
};