Leetcode刷题-001两数之和

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

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

void test01() {
	vector<int> m_num;
	m_num.push_back(2);
	m_num.push_back(7);
	m_num.push_back(11);
	m_num.push_back(15);
	int m_target = 26;

	Solution S;
	vector<int>result = S.twoSum(m_num, m_target);
	cout << result[0] << "  " << result[1] << endl;
}

int main()
{
	test01();
	system("pause");
	return 0;
}