twosum

最新推荐文章于 2025-04-09 16:12:02 发布

原创最新推荐文章于 2025-04-09 16:12:02 发布 · 232 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

38 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的算法实现，通过遍历整型数组找到两个数，使得这两个数的和等于给定的目标值。虽然此方法不是最优解，但清晰展示了双层循环查找的过程。

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

//这不是最优方法，用哈希是最优的，见leetcode

#include<iostream>
#include<vector>
using namespace std;
class solution{
public:
vector<int> find(vector<int>&num,int&target)//由于这里的rev是在类的函数内声明的
//当函数返回时rev在返回后会销毁，因此不能返回引用，只能是值
{
vector<int> rev;
for (int i = 0; i < num.size(); i++)
{
for (int j = i+1; j < num.size(); j++)
{
int re = num[i] + num[j];
if (re == target)
{
rev.push_back(i);
rev.push_back(j);
return rev;
}
}
}

}
};
int main()
{
vector<int> num = { 2, 7, 11, 15 ,32,34,43,343,65};
int target = 77;
solution s;
vector<int> result=s.find(num, target);
cout << result[0] << ' ' << result[1] << endl;
}