LeetCode 1. Two Sum

最新推荐文章于 2020-10-21 10:33:51 发布

原创最新推荐文章于 2020-10-21 10:33:51 发布 · 230 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #numbers #cpp #sum #vector

LeetCode 专栏收录该内容

66 篇文章

订阅专栏

本文介绍了一个经典的算法问题——两数之和。通过给定的整数数组及目标值，寻找两个数相加等于目标值的下标。文中提供了一个C++实现的例子，并详细解释了如何遍历数组找到符合条件的元素。

Description

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

Code

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