LintCode-剑指Offer-(56)两数之和

class Solution {
public:
    /*
    * @param numbers : An array of Integer
    * @param target : target = numbers[index1] + numbers[index2]
    * @return : [index1+1, index2+1] (index1 < index2)
    */
    vector<int> twoSum(vector<int> &nums,int target) {
        // write your code here
        vector<int> tmp;
        for (int i = 0;i<nums.size();i++){
            for (int j = nums.size()-1;j>i;j--){
                if (nums[i]+nums[j]==target){
                    tmp.push_back(i+1);
                    tmp.push_back(j+1);
                    return tmp;
                }
            }
        }
        return tmp;
    }
};