[LeetCode]1. Two Sum (C++)

1. Two Sum

Easy

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

class Solution{
public:
    vector<int> twoSum(vector<int>& nums, int target)
    {
        vector<int> res;
        for(int i=0;i<nums.size();i++)
        {
            int start=nums[i];
            for(int j=i+1;j<nums.size();j++)
            {
                if (start+nums[j]==target)
                {
                    res.push_back(i);
                    res.push_back(j);
                }
            } 
        }
        return res;
    }
};
©️2020 CSDN 皮肤主题: 数字20 设计师:CSDN官方博客 返回首页