[LeetCode]1. Two Sum

最新推荐文章于 2020-02-14 22:46:09 发布

原创最新推荐文章于 2020-02-14 22:46:09 发布 · 220 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Coding 同时被 3 个专栏收录

19 篇文章

订阅专栏

C++

19 篇文章

订阅专栏

LeetCode

13 篇文章

订阅专栏

本文介绍了一个经典的编程面试题——TwoSum问题。给定一个整数数组及目标值，找到两个数的索引使得它们相加等于目标值。文章提供了一个C++实现的解决方案，并详细解释了如何遍历数组寻找符合条件的元素。

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

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