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

Example:

Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].

---

题目大意：

给定一个数组nums,一个数字target, 其中在数组nums中有两个数字

num[i]和num[j]的和等于target,输出返回只有i和j两个元素的一个数组。

---

题目代码：

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