LeetCode 167 TwoSumII-InputArrayIsSorted

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.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

class Solution {

public:

    vector<int> twoSum(vector<int>& numbers, int target) {

    }

};

解题思路：

• 自己的解题思路

此题，比较简单。略

• 别人的解题思路

略

学习收获：

• 学习一些精简的代码
• LeetCode 适当改变函数形式也是正确的。

附件：程序

1、自己的程序：

class Solution

{

     public :

     vector < int > twoSum ( vector < int >& numbers , int target )

     {

         if ( numbers . size () < 2 )

         {

             return {};

         }

         vector < int >:: size_type i = 0 , j = numbers . size () - 1 ;

         while ( i < j )

         {

             int curSum = numbers [ i ] + numbers [ j ];

             if ( curSum < target )

             {

                 ++ i ;

             }

             else if ( curSum > target )

             {

                 -- j ;

             }

             else

             {

                 break ;

             }

         }

     }

};

2、别人的程序

比较耐人寻味的解法。用的是递归，但是还用到了默认参数。 LeetCode还能这么玩。

vector < int > twoSum ( vector < int >& A , int t , int i = 0 , int j = 1 , int d = 0 )

{

     return ( d = A [ i ] + A [ A . size () - j ] - t ) ? twoSum ( A , t , i + ( d < 0 ), j + ( d > 0 )) : vector < int >{ ++ i , A . size () - j + 1 };

}

精简的代码

vector < int > twoSum ( vector < int >& A , int target )

{

     int i = 0 , j = A . size () - 1 , d ;

     while ( d = A [ i ] + A [ j ] - target ) d < 0 ? ++ i : -- j ;

     return { ++ i , ++ j };

}