[leetcode] Two Sum

[leetcode1]

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

---

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
                vector<int>result;
        for (int i = 0; i < nums.size(); i++)
        {
            int second = target - nums[i];
            int low = i + 1;
            int high = nums.size() - 1;
            while (low < high && second != nums[low] && second != nums[high])
            {
                low++; high--;
            }
            if (second == nums[low])
            {
                result.push_back(i);
                result.push_back(low);
                return result;
            }
            else if (second == nums[high])
            {
                result.push_back(i);
                result.push_back(high);
                return result;
            }
        }
        return result;
    }
};