zoukankan      html  css  js  c++  java
  • 2Sum 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

    public class Solution {
        public int[] twoSum(int[] numbers, int target) 
        {
                int[] index = new int[2];
                int start = 0;
                int end = numbers.length-1;
                while(start<end)
                {
                    if(numbers[start]+numbers[end]==target)
                    {
                        index[0] = start+1;
                        index[1] = end+1;
                        break;
                    }
                    else if(numbers[start]+numbers[end]<target)
                    {
                        start++;
                    }
                    else end--;
                }
                return index;
        }
    }
  • 相关阅读:
    THINKPHP导入全部post参数
    thinkphp 表单一些
    随机唯一不重复
    TP关联模型
    PHP函数之类
    MSSQLid清零
    httpwebrequest异步参考
    反射
    UrlOper
    工作周记
  • 原文地址:https://www.cnblogs.com/hygeia/p/5097717.html
Copyright © 2011-2022 走看看