refactor 167 again

fishercoder1534 · fishercoder1534 · commit 46a9e27f753a · 2018-05-26T07:09:19.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_167.java b/src/main/java/com/fishercoder/solutions/_167.java
@@ -2,16 +2,22 @@
 
 /**
  * 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
+
+ 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.
+
+ Note:
+
+ 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.
+
+ Example:
+
+ Input: numbers = [2,7,11,15], target = 9
+ Output: [1,2]
+ Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
+
  */
 
 public class _167 {
