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.（可以假设每个输入只有一个结果）
Example:
Given nums = [2, 7, 11, 15], target = 9,

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

1.个人分析
最直观的做法就是使用两个循环来找出能得到目标值的两个数

2.个人解法

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