LeetCode(01TowSum)

LeetCode(01TowSum)

#include <iostream>
#include <vector>
using namespace std;
/**

Given an array of integers, return indices of the two numbers
such that they add up to a specific target.
You may assume that each input would have exactly one solution,
and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

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

int main()
{
    Solution a;
    vector<int> nums;
    nums.push_back(2);
    nums.push_back(7);
    nums.push_back(11);
    nums.push_back(15);
    vector<int> ret = a.twoSum(nums, 9);
}