leetcode001 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.

Example:

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

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

解题思路

第一反应暴力，直接遍历数组，找两数之和等于target的下标。时间复杂度O(N2)

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

    }   
};

可以通过，但是时间复杂度高。在分析时只看例子思考，忽略了要整体对比，不能只是前后对比！