top200两数之和

class Solution {
public:
    /**
     * 
     * @param numbers int整型vector 
     * @param target int整型 
     * @return int整型vector
     */
    vector<int> twoSum(vector<int>& numbers, int target) {
        // write code here
        int index1=-1,index2=-1;
        int a=numbers.size();
        for(int i=0;i<a;i++){
            for(int j=i+1;j<a;j++){
                if(numbers[i]+numbers[j]==target){
                    index1=i+1;
                    index2=j+1;
                    break;
                }
            }
        }
        vector<int> result;
        result.push_back(index1);
        result.push_back(index2);
        return result;
    }
};

不是太会用vector，再练练