leetcode two sum

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) 
    {
        vector<int>output;
        int i,j;
        for(i=0;i<numbers.size()-1;i++)
        {
            for(j=numbers.size()-1;j>i;j--)
            {
                if(numbers[i]+numbers[j]==target)
                {
                    output.push_back(i+1);
                    output.push_back(j+1);
                }
            }
        }
        return output;
    }
};

  

原文地址:https://www.cnblogs.com/tgkx1054/p/3088434.html