zoukankan      html  css  js  c++  java
  • 167. Two Sum II

    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

    2 pointer,从左右往中间查找。

    public int[] TwoSum(int[] numbers, int target) {
            var res = new int[2];
            if(numbers.Count() == 0) return null;
            int left = 0;
            int right = numbers.Count()-1;
            while(left<right)
            {
                if(numbers[left] + numbers[right] == target) return new int[2]{left+1,right+1};
                if(numbers[left] + numbers[right] < target) left++;
                else right--;
            }
            return null;
        }
  • 相关阅读:
    方法
    Go中的OOP
    GO 结构体
    指针
    闭包
    回调函数
    匿名函数
    函数的数据类型及本质
    defer语句
    递归函数
  • 原文地址:https://www.cnblogs.com/renyualbert/p/5871460.html
Copyright © 2011-2022 走看看