two_sum_II

Author: hitzzc

README.md

@@ -144,6 +144,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [164. Maximum Gap](https://github.com/hitzzc/go-leetcode/tree/master/maximum_gap)
 #### [165. compare version numbers](https://github.com/hitzzc/go-leetcode/tree/master/compare_version_numbers)
 #### [166. Fraction to Recurring Decimal](https://github.com/hitzzc/go-leetcode/tree/master/fraction_to_recurring_decimal)
+#### [167. Two Sum II](https://github.com/hitzzc/go-leetcode/tree/master/two_sum_II)
 
 
 

two_sum_II/two_sum_II.go

@@ -0,0 +1,18 @@
+package two_sum_II
+
+func twoSum(numbers []int, target int) []int {
+	i, j := 0, len(numbers)-1
+	var sum int
+	for i < j {
+		sum = numbers[i] + numbers[j]
+		if sum == target {
+			return []int{i + 1, j + 1}
+		}
+		if sum < target {
+			i++
+		} else {
+			j--
+		}
+	}
+	return []int{}
+}