2017-09-07 LeetCode_001 Two Sum

1. 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.

Example:

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

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

Solutiom:

class Solution {

2

public:

3

    vector<int> twoSum(vector<int>& nums, int target) {

4

        vector<int> ans;

5

        int n = nums.size();

6

        for (int i = 0; i < n; i++)

7

            for (int j = i+1; j < n; j++)

8

                if (nums[i]+nums[j] == target) {

9

                    ans.push_back(i); ans.push_back(j); return ans;

10

                }

11

        return ans;

12

    }

13

};