change class name and add in README.md

fishercoder1534 · fishercoder1534 · commit a192006b330a · 2017-04-30T13:16:32.000-07:00
diff --git a/README.md b/README.md
@@ -270,6 +270,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/)|[Solution](../master/src/main/java/com/stevesun/solutions/TwoSumIIIDataStructureDesign.java)| O(n)|O(n)| Easy
 |169|[Majority Element](https://leetcode.com/problems/majority-element/)|[Solution](../master/src/main/java/com/stevesun/solutions/MajorityElement.java)| O(n)|O(1) | Easy|
 |168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/)|[Solution](../master/src/main/java/com/stevesun/solutions/ExcelSheetColumnTitle.java)| O(n)|O(1) | Easy|
+|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)|[Solution](../master/src/main/java/com/stevesun/solutions/_167.java)| O(logn)|O(1) | Easy|
 |165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)|[Solution](../master/src/main/java/com/stevesun/solutions/CompareVersionNumbers.java)| O(n)|O(1) | Easy|
 |164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[Solution](../master/src/main/java/com/stevesun/solutions/MaximumGap.java) | O(n) |O(n) | Hard|
 |163|[Missing Ranges](https://leetcode.com/problems/missing-ranges/)|[Solution](../master/src/main/java/com/stevesun/solutions/MissingRanges.java) | O(n) |O(1) | |
diff --git a/src/main/java/com/stevesun/solutions/_167.java b/src/main/java/com/stevesun/solutions/_167.java
@@ -3,6 +3,8 @@
 import com.stevesun.common.utils.CommonUtils;
 
 /**
+ * 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.
@@ -13,7 +15,7 @@ The function twoSum should return indices of the two numbers such that they add
  Output: index1=1, index2=2
 
  */
-public class TwoSumIIInputArrayIsSorted {
+public class _167 {
     public static int[] twoSum(int[] numbers, int target) {
         int left = 0, right = numbers.length-1;
         int[] result = new int[2];
