Friday, January 19, 2018

Two Sum

Two Sum

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.

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 (target == (nums[i] + nums[j]))  {
                    vector<int> v(2,0);
                    v[0] = i; v[1] = j;
                    return v;
                }
                    
            }
        }
    }
};
Example:
Given nums = [2, 7, 11, 15], target = 9,

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

No comments:

Post a Comment