【Leetcode】1. Two Sum

//题目要求

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

//找到相加和为target的两个数组成的vector， 同一个元素不能使用两次，唯一解

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

class Solution {
public:
	vector<int> twoSum(vector<int>& nums, int target) {
		//比较的vector是参数已经给出来了，target也是参数，直接用就好
		int length = nums.size();
		//创建ans vector
		vector<int> a(2);
		//两个两个一组，不能有重复的顺序遍历
		for(int i = 0; i < length; i++)
			for(int j = i+1; j < length; j++){
				if((target-nums[i])==nums[j]){
					a[0] = i;
					a[1] = j;
					return a;
				}
			}
		return a;
	}
};

1. 两个两个一组，不能有重复的循环方法：  

   for(int i = 0; i < length; i++)
       for(int j = i+1; j < length; j++)