Leetcode - Two Sum II - Input array is sorted

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

Since the array is sorted, use two pointers to do iteration. Left pointer is from the beginning, right pointer is from the end. Sum up left and right and compare sum with target. If the target is equal to sum, return left+1 and right+1

func twoSum(numbers []int, target int) []int {
    left := 0
    right := len(numbers)-1
    for left < right {
        sum := numbers[left] + numbers[right]
        if sum == target {
            return []int{left+1, right+1}
        }
        if sum > target {
            right--
        }
        if sum < target {
            left++
        }
    }
    return nil
}

# @param {Integer[]} numbers
# @param {Integer} target
# @return {Integer[]}

def two_sum numbers, target
    left = 0
    right = numbers.length - 1
    while left < right
        sum = numbers[left] + numbers[right]
        if sum == target
            return [left+1, right+1]
        end
        if sum < target
            left += 1
        else
            right -= 1
        end
    end
end

• 相关文章
• 全局相关文章