数组中和为k的所有索引对

默认数组中没有重复元素

#include <bits/stdc++.h>
using namespace std;


vector<pair<int, int>> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> mp;
        vector<pair<int, int>> ans;
        int len = nums.size();
        for(int i = 0; i < len; ++i){
            if(mp.find(target - nums[i]) != mp.end()) ans.push_back(make_pair(i, mp[target - nums[i]]));
            else mp[nums[i]] = i;
        }
        return ans;

    }

int main(){
    vector<int> nums{1, 2, 3, 4, 5, 6, 7, 8};
    vector<pair<int, int>> ans = twoSum(nums, 11);
    for(auto &a : ans){
        cout<<a.first<<" "<<a.second<<endl;
    }

    cout<<"hello world!"<<endl;
    return 0;
}