LeetCode: Two Sum

最新推荐文章于 2025-11-06 21:54:53 发布

原创最新推荐文章于 2025-11-06 21:54:53 发布 · 2.7k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#numbers #output #function #less #input

LeetCode 专栏收录该内容

186 篇文章

订阅专栏

本文介绍了一种算法，用于在整数数组中找到两个数，它们的和等于指定的目标值。通过双层循环遍历数组，算法返回符合条件的数的索引，且索引值不为零。

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

#include<iostream>
#include<vector>
#include<string>
using namespace::std;



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 index1 = 0, index2 = 0;
		vector<int> result(2, 0);
		for(int i = 0; i < numbers.size(); i++)
		{
			for(int j = i + 1; j < numbers.size(); j++)
			{
				if(numbers[i] + numbers[j] == target)
				{
					result[0] = i + 1;
					result[1] = j + 1;

				}
			}
		}
		return result;
        
    }
};

int main()
{
	Solution ss;
	bool result = ss.isValid("((");
	cout<<"result:"<<result<<endl;
}

Round 2:

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