Function twoSumSortedInput

two_sum_1/solution.go:25–50

twoSumSortedInput assumes that nums is sorted.

(nums []int, target int)

// twoSumSortedInput assumes that nums is sorted.
func twoSumSortedInput(nums []int, target int) []int {
	numsLen := len(nums)
	if numsLen < 2 {
		return []int{}
	}

	front := 0
	rear := numsLen - 1
	for front != rear {
		twoSum := nums[front] + nums[rear]
		if twoSum == target {
			return []int{
				front,
				rear,
			}
		}

		if twoSum < target {
			front++
		} else {
			rear--
		}
	}

	return []int{}
}