leetCode: two Sum

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

#include<iostream>
#include<string>
#include<vector>
using namespace std;

class Solution{
public:
    int twoSum(vector<int> &numbers,vector<int> &position,int target);
    vector<int> twoSum(vector<int> &numbers,int target);
};

int Solution:: twoSum(vector<int> &numbers,vector<int> &position,int target){
    int length=numbers.size();
    for(int i=0;i<length;i++){
        int sum=0;
        for(int j=i+1;j<length;j++){
            sum=numbers[i]+numbers[j];
            if(sum==target){
                position[0]=i;
                position[1]=j;
                return 1;
            }
        }
    }
    return 0;
}

//在这个方法中，在函数内部建立position向量数组，然后没有释放，所我们可以返回这个数组
vector<int> Solution:: twoSum(vector<int> &numbers,int target){
    int length=numbers.size();
    vector<int> position(2);
    for(int i=0;i<length;i++){
        int sum=0;
        for(int j=i+1;j<length;j++){
            sum=numbers[i]+numbers[j];
            if(sum==target){
                position[0]=i;
                position[1]=j;
                return position;
            }
        }
    }
    return position;
}

int main(){
    int array[]={2,7,11,15};
    vector<int> numbers(array,array+4);
    vector<int> result(2);
    Solution s;
//    s.twoSum(numbers,result,9);
    result=s.twoSum(numbers,9);
    cout<<result[0]<<" "<<result[1]<<endl;
    return 1;
}