给定一个整数数组，返回数组中两个元素的和为target的索引

最新推荐文章于 2023-02-13 17:21:59 发布

yanghui_429

最新推荐文章于 2023-02-13 17:21:59 发布

阅读量2.4k

点赞数 1

分类专栏： Leetcode 文章标签： algorithm

本文链接：https://blog.csdn.net/YANGHUI_429/article/details/72808806

版权

Leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Two Sum

给定一个数组，返回数组中两个元素加起来为target的元素索引

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

My code is as follows:

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