leedcode167 two sum

方法一：

直观暴力解法，双层遍历，时间复杂度是O(n^2)，在力扣上超出时间限制。

方法二：

因为是有序数组，我们选取数组顶端作为指针i，并对指针右侧的剩余数组进行二分搜索。每次i+1，对数组进行遍历。这里要注意，对于没有解的情况，要添加throw invalid_argument("The input has no solution.");

这是因为，题目中没有说明保证有解。

方法三：

对撞指针法，选取数组左侧为指针i，数组右侧为指针j，判断nums[i]+nums[j]与target的关系；

若相等，返回对应指针i+1，j+1；

若小于，i++；

若大于，j--;

#include<iostream>
#include<cassert>
#include<vector>
#include<stdexcept>

using namespace std;

//对撞指针法
class Solution1 {
public:
	vector<int> twoSum(vector<int>& numbers, int target) {
		assert(numbers.size() >= 2);
		int l = 0;
		int r = numbers.size() - 1;
		while (l < r) {
			if (numbers[l] + numbers[r] == target) {
				int res[2] = { l + 1,r + 1 };
				return vector<int>(res, res + 2);
			}
			else if (numbers[l] + numbers[r] < target)
				l++;
			else
				r--;
		}
		throw invalid_argument("The input has no solution.");
	}
};
class Solution {
public:
	vector<int> twoSum(vector<int>& numbers, int target) {
		vector<int> result;
		int temp;
		int left = 0;
		int right = numbers.size() - 1;
		while (left < right)
		{
			temp = numbers[left] + numbers[right];
			if (temp == target)
			{
				result.push_back(left + 1);
				result.push_back(right + 1);
				break;
			}
			else if (temp < target)
			{
				left++;
			}
			else
			{
				right--;
			}
		}

		return result;
	}
};
//双层遍历
class Solution2 {
public:
	vector<int> twoSum(vector<int>& numbers, int target) {
		int res[2];
		for (int i = 0; i < numbers.size(); i++)
		{
			for (int j = 0; j < numbers.size(); j++)
			{
				if ((i != j) && (numbers[i] + numbers[j] == target))
				{
					res[0] = i + 1;
					res[1] = j + 1;
					return vector<int>(res, res + 2);
				}
			}
		}
		throw invalid_argument("The input has no solution.");
	}
};
//二分搜索
class Solution3 {
public:
	vector<int> twoSum(vector<int>& numbers, int target) {
		
		int r = numbers.size() - 1;
		int i = 0;
		int l = i + 1;
		while (i < numbers.size()) {
			while (l <= r) {
				int mid = l + (r - l) / 2;
				if (numbers[mid] == target - numbers[i]) {
					int res[2] = { i + 1, mid + 1 };
					return vector<int>(res, res + 2);
				}
				else if (numbers[mid] < target - numbers[i]) {
					l = mid + 1;
				}
				else {
					r = mid - 1;
				}
		}
			i++;
			l = i + 1;
			r = numbers.size() - 1;
		}
		throw invalid_argument("The input has no solution.");
	}
};
int main(int argc, char**argv[]) {
	int A[] = {5,25,75};
	vector<int> vec1(A, A + sizeof(A) / sizeof(int));
	int b[2];
	vector<int> result1(b,b+2);

	result1 = Solution3().twoSum(vec1, 100);
	for (int i = 0; i < result1.size(); i++)
		cout << result1.at(i) << endl;
	return 0;
}