[LeetCode] 1.Two Sum (Easy)

//1차 C++ 2019.04.10
class Solution {
public:
    vector twoSum(vector& nums, int target) {
        vector answer;
        
        for(int i=0; i< nums.size(); i++)
        {
            for(int j=i+1; j<nums.size();j++)
            {
                int sums = nums[i] + nums[j];
                if(sums == target)
                {
                    answer.push_back(i);
                    answer.push_back(j);
                    return answer;
                }
            }
        }
        return answer;
    }
};