1. 两数之和

哈希表
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
	vector<int> result;
	map<int, int> tmpmap;//键值为nums的值，变量值为nums下标
 
	for (int i = 0; i < nums.size(); ++i) {
		tmpmap[nums[i]] = i;
	}
	for (int i = 0; i < nums.size(); ++i) {
		if (tmpmap.count(target - nums[i]) != 0 && tmpmap[target-nums[i]]!=i) {
            //循环到找不到第二组返回
			result.push_back(i);
			result.push_back(tmpmap[target - nums[i]]);
			break;
		}
	}
	return result;
}
    
};

暴力法
vector<int> twoSum(vector<int>& nums, int target) {
	vector<int> result;
	for (int i = 0; i < nums.size(); ++i) {
		int surplus = target - nums[i];
		for (int j = i + 1; j < nums.size(); ++j) {
			if (surplus == nums[j]) {
				result.push_back(i);
				result.push_back(j);
				return result;
			}
		}
	}
	return result;