1-Two Sum

难度：easy

1.题目描述

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.

2.题目理解

这道题目比较简单，只需要用一个两层循环，将数字两两进行相加，并且判断是否与target的值相同即可。

3.代码实现

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