[LeetCode 解题报告]001.Two Sum

Description:

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 thesame element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].

从一个数组中找到找到一对和为target的元素。并返回其下标。暴力解法如下：

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