@@ -0,0 +1,979 @@
+%22%22%22Leetcode 167. Two Sum II - Input array is sorted%0AEasy%0A%0AURL: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/%0A%0AGiven an array of integers that is already sorted in ascending order,%0Afind two numbers such that they add up to a specific target number.%0A%0AThe function twoSum should return indices of the two numbers such that they%0Aadd up to the target, where index1 must be less than index2.%0A%0ANote:%0A- Your returned answers (both index1 and index2) are not zero-based.%0A- You may assume that each input would have exactly one solution and you may not use the same element twice.%0A%0AExample:%0AInput: numbers = %5B2,7,11,15%5D, target = 9%0AOutput: %5B1,2%5D%0AExplanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def twoSum(self, numbers, target):%0A        %22%22%22%0A        :type numbers: List%5Bint%5D%0A        :type target: int%0A        :rtype: List%5Bint%5D%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0167_two_sum_ii_Input_array_is_sorted.py