two sum 已知两数之和，在数组中找处两数

#include <iostream>
#include "unistd.h"
#include "map"
using namespace std;

int TwoSum(int nums[],int len,int sum,int arr[2]){
    map<int,int> numMap;
    map<int,int>::iterator iter;
    printf("%s","hello world");
    for (int i=0;i<len;i++){
        iter  = numMap.find(sum-nums[i]);
        if (iter != numMap.end()){
            arr[0]= nums[i];
            arr[1] = sum-nums[i];
            printf("num %d %d \n", nums[i],sum-nums[i]);
            return 0;
        }
        printf("%d i \n",nums[i]);
        numMap.insert(pair<int, int>(nums[i],1));
    }

    for (int i=0;i<2;i++){
        printf("%d\n",arr[i]);
    }
    return 0;
}

int main(){
    int nums[] = {2,7,11,15};
    int arr[2];
    printf("%s","hello world\n");
    TwoSum(nums,4,26,arr);
}