已知两数和，求两数位置

最新推荐文章于 2023-09-07 01:08:42 发布

我要取一个不会重复的名字

最新推荐文章于 2023-09-07 01:08:42 发布

阅读量126

点赞数 1

文章标签：求两数位置已知和

本文链接：https://blog.csdn.net/weixin_41767070/article/details/91975961

版权

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

本题的解题思路是：看一个数字，求出target-number[i]的结果，往i的后面去找这个结果，这样的时间复杂度还是有点高，不知道还有没有更好的了，如果有这个列表是有序的话，我个人感觉还能用二分法找一找。但这个题没说，就暴力解决吧。

class Solution {
public:
	vector<int> twoSum(vector<int> &numbers, int target) {
		int i = 0;
		vector<int>re(2);
		auto beg = numbers.begin();
		auto end = numbers.end();
		auto pos = beg;
		for (; i < numbers.size(); i++) {
			pos = find(beg + i+1, end, target - numbers[i]);
			if (pos != end) {
				re[0] = i + 1;
				re[1] = (pos - beg) + 1;
				break;
			}
		}
		return re;
	}
};