算法設計與應用基礎作業（二）

題目地址：點擊打開鏈接

題目描述：

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.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

我的代碼：

class Solution {
	public:
		vector<int> twoSum(vector<int>& nums, int target) {
			vector<int> v;//返回vector
			for(int i=0; i<nums.capacity()-1 ; i++) {
				for(int j=i+1; j<nums.capacity() ; j++) {
					if(nums[i]+nums[j]==target){
						v.push_back(i);
						v.push_back(j);
						return v;  
					}  
				}
			}
		}
};