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

---

这应该是leetcode里最简单的题，简单的循环。

---

 

以下是我的代码：

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