leet_code_001

题目:

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

给出一个整型数组，找出其中相加结果为一个指定数的两个数。
函数twoSum应该返回和为指定是的两个数的索引，索引按从小到大排列，索引的值从1开始计算。
你可以假定每个输入都只有一个正确的结果。

思路：
这个问题其实是对数组的遍历。

code C++

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