LeetCode 1. 两数之和

 

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