leetcode-gulag/1-two-sum/soln.cpp

#include "soln.hpp"

vector<int> Solution::twoSum(vector<int> &nums, int target)
{
	vector<int> result(2);
	for (int i = 0; i < nums.size(); i++)
	{
		for (int j = i + 1; j < nums.size(); j++)
		{
			if (nums[i] + nums[j] == target)
			{
				result[0] = i;
				result[1] = j;
				return result;
			}
		}
	}
	return result;
}

bool Solution::test(vector<int> &nums, int target, vector<int> &answer)
{
	return twoSum(nums, target) == answer;
}