update

Author: kamyu104

Python/two-sum-ii-input-array-is-sorted.py

@@ -0,0 +1,30 @@
+# Time:  O(n)
+# Space: O(1)
+#
+# 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:
+    def twoSum(self, nums, target):
+        start, end = 0, len(nums) - 1
+        
+        while start != end:
+            if nums[start] + nums[end] > target:
+                end -= 1
+            elif nums[start] + nums[end] < target:
+                start += 1
+            else:
+                return [start + 1, end + 1]
+
+if __name__ == "__main__":
+    print Solution().twoSum([2, 7, 11, 15], 9)

README.md

@@ -1,9 +1,9 @@
 LeetCode
 ======== 
 
-Up to date (2014-12-16), there are total `166` problems on [LeetCode Online Judge](https://oj.leetcode.com/).
+Up to date (2014-12-18), there are total `167` problems on [LeetCode Online Judge](https://oj.leetcode.com/).
 The number of problems is increasing recently.
-Here is the classification of all `166` problems.
+Here is the classification of all `167` problems.
 I'll keep updating for full summary and better solutions. Stay tuned for updates.
 
 --- 
@@ -472,6 +472,7 @@ Problem         |  Solution       |  Time           | Space           | Difficul
 [Search in Rotated Sorted Array II] | [search-in-rotated-sorted-array-ii.py] | _O(logn)_ | _O(1)_   | Medium         |
 [Search Insert Position] | [search-insert-position.py] | _O(logn)_ | _O(1)_   | Medium         |
 [Sqrt(x)]       | [sqrtx.py]      | _O(logn)_        | _O(1)_         | Medium         |
+[Two Sum II - Input array is sorted] | [two-sum-ii-input-array-is-sorted.py] | _O(n)_   | _O(1)_         | Medium         |
 
 [Find Minimum in Rotated Sorted Array]:https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/
 [find-minimum-in-rotated-sorted-array.py]:https://github.com/kamyu104/LeetCode/blob/master/Python/find-minimum-in-rotated-sorted-array.py
@@ -495,7 +496,8 @@ Problem         |  Solution       |  Time           | Space           | Difficul
 [search-insert-position.py]:https://github.com/kamyu104/LeetCode/blob/master/Python/search-insert-position.py
 [Sqrt(x)]:https://oj.leetcode.com/problems/sqrtx/
 [sqrtx.py]:https://github.com/kamyu104/LeetCode/blob/master/Python/sqrtx.py
-
+[Two Sum II - Input array is sorted]:https://oj.leetcode.com/problems/two-sum-ii-input-array-is-sorted/
+[two-sum-ii-input-array-is-sorted.py]:https://github.com/kamyu104/LeetCode/blob/master/Python/wo-sum-ii-input-array-is-sorted.py
 
 ---