[Week 2] [Leetcode][Array] Two Sum

GeeGeeZi

于 2017-06-16 17:17:49 发布

阅读量238

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/GeeGeeZi/article/details/73340698

本文介绍了一种解决两数之和问题的经典算法。给定一个整数数组和一个目标值，找出数组中和为目标值的两个数，并返回它们的数组下标。文章通过C++代码实现了解决方案，采用双重循环遍历数组来寻找符合条件的两个数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question: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 haveexactly 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].

Analysis:
Code:

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