167. Two Sum II - Input array is sorted

题目描述

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution and you may not use the same element twice.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

解答思路

1. 遍历整个数组，使用哈希的思想来存储遍历的值。但是实现之后出现问题，因为值有负数。

2. 因为是排好序的，可以利用这个属性，分别从左到右和从右到左遍历数组。

代码如下：

1. 第一种方法，实现起来有问题：

   class Solution {
   public:
       vector<int> twoSum(vector<int>& numbers, int target) {
           vector <int> store(target + 1, -999999);
           for (int i = 0; i < numbers.size(); ++i) {
               if (store[target - numbers[i]] != -999999) {
                   vector <int> result;
                   result.push_back(store[target - numbers[i]] + 1);
                   result.push_back(i + 1);
                   return result;
               }
               //这里numbers[i]可能为负数，不能作为下标
               store[numbers[i]] = i;
           }
       }
   };

2. 第二种方法：

   vector<int> twoSum(vector<int>& numbers, int target) {      
           int l = 0;
           int r = numbers.size() -1;
           while(l < r){
               if(numbers[l] + numbers[r] == target){
                   vector<int> res{l+1,r+1};
                   return res;
               }
               else if(numbers[l] + numbers[r] > target){
                   r--;
               }
               else{
                   l++;
               }
           }
       }

---

题目描述：1. 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> &numbers, int target)
{
    //Key is the number and value is its index in the vector.
    unordered_map<int, int> hash;
    vector<int> result;
    for (int i = 0; i < numbers.size(); i++) {
        int numberToFind = target - numbers[i];

            //if numberToFind is found in map, return them
        if (hash.find(numberToFind) != hash.end()) {
                    //+1 because indices are NOT zero based
            result.push_back(hash[numberToFind]);
            result.push_back(i);            
            return result;
        }

            //number was not found. Put it in the map.
        hash[numbers[i]] = i;
    }
    return result;
}
};