package com.fishercoder.solutions;

/**
 * 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
 */

public class _167 {
    public static class Solution1 {
        public int[] twoSum(int[] numbers, int target) {
            int left = 0;
            int right = numbers.length - 1;
            while (left < right) {
                long sum = numbers[left] + numbers[right];
                if (sum > target) {
                    right--;
                } else if (sum < target) {
                    left++;
                } else {
                    int[] res = new int[2];
                    res[0] = left + 1;
                    res[1] = right + 1;
                    return res;
                }
            }
            return new int[] {-1, -1};
        }
    }
}

@@ -80,13 +80,9 @@
 ted%0A
- *%0A *
+%0A
  Giv
@@ -147,19 +147,16 @@
 g order,
-%0A *
  find tw
@@ -216,18 +216,17 @@
 number.%0A
- *
+%0A
  The fun
@@ -315,19 +315,16 @@
  target,
-%0A *
  where i
@@ -359,29 +359,19 @@
 x2.%0A
- * Please note that y
+%0A Note:%0A%0A Y
 our 
@@ -432,18 +432,16 @@
 -based.%0A
- *
  You may
@@ -495,17 +495,71 @@
 solution
-.
+ and you may not use the same element twice.%0A%0A Example:
 %0A%0A Input
@@ -571,31 +571,30 @@
 bers
-=%7B
+ = %5B
 2,
- 
 7,
- 
 11,
- 
 15
-%7D
+%5D
 , target
 =9%0A 
@@ -589,17 +589,19 @@
 , target
-=
+ = 
 9%0A Outpu
@@ -606,16 +606,73 @@
 put:
+ %5B1,2%5D%0A Explanation: The sum of 2 and 7 is 9. Therefore
  index1
-=
+ = 
 1, i
@@ -680,10 +680,14 @@
 dex2
-=2
+ = 2.%0A
 %0A */

refactor 167 again