本文共 1228 字，大约阅读时间需要 4 分钟。

1、题目

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 and you may not use the same element twice.

Input: numbers={2, 7, 11, 15}, target=9

2、代码实现

public class Solution {    public int[] twoSum(int[] nums, int target) {        if (null == nums)              return null;                 int[] result = new int[2];          HashMap
   
     map = new HashMap
    
     ();          for (int i = 0; i < nums.length; ++i) {              Integer value = map.get(nums[i]);              if (null == value)                   map.put(nums[i], i);              Integer index = map.get(target - nums[i]);              if (null != index && index < i)              {                  result[0] = index + 1;                  result[1] = i + 1;              }          }          return result;      }}
    
   

转载地址：https://chenyu.blog.csdn.net/article/details/69810329 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！