LeetCode 1 - Two Sum

最新推荐文章于 2021-12-23 23:38:17 发布

原创最新推荐文章于 2021-12-23 23:38:17 发布 · 256 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

9 篇文章

订阅专栏

此博客介绍了一个算法解决方案，用于在整数数组中找到两个数，它们相加等于给定的目标值。该方法通过双层循环遍历数组元素，以确定符合条件的数对，并返回它们的索引。

Two Sum Mar 14 '11

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int size = numbers.size();
        for (int i = 0; i < size; i++)
            for (int j = i+1; j < size; j++)
                if (numbers[i] + numbers[j] == target) {
                    vector<int> r;
                    r.push_back(i+1);
                    r.push_back(j+1);
                    return r;
                }
    }
};