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
Output: index1=1, index2=2

Subscribe to see which companies asked this question.

?

?

?

?

2、代碼實現

?

public class Solution {public int[] twoSum(int[] nums, int target) {if (null == nums) return null; int[] result = new int[2]; HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); 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; } }

?

?

?

?

?

總結

以上是生活随笔為你收集整理的LeetCode之Two Sum II - Input array is sorted的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。