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

简述：给一个数组和一个目标数，输出数组里面两个和为目标数的下标

最简单的一个一个适配，遇到两个加起来等于target的时候就把两个下标存入数组，再返回

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