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

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> two;
        for(int i=0; i<nums.size(); i++)
            if((nums[i] <= target && target>=0) || (nums[i] >= target && target<=0))
                for(int j=i+1; j<nums.size(); j++)
                    if(nums[i] + nums[j] == target)
                    {
                        two.push_back(i);
                        two.push_back(j);
                        return two;
                    }
    }
};

注意：
target有可能为负数。
如果不对第一个加数判断，会超时。