首页 > 代码库 > Two Sum
Two Sum
Given an array of integers, 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
最先我使用的方法是两个for循环的方法，时间复杂度为O(n2)。但是，在线测试提示时间超时，因此必须考虑更加简单的方法，
public class Solution { public int[] twoSum(int[] numbers, int target) { int[]temp = new int[2]; Map<Integer,Integer>map = new HashMap<Integer,Integer>(); for(int i = 0;i<numbers.length;i++){ if(map.get(numbers[i])==null){ map.put(numbers[i],i); } if(map.containsKey(target-numbers[i])&& i !=map.get(target-numbers[i])){ temp[1] = i+1; temp[0] = map.get(target-numbers[i])+1; return temp; } } return temp; }}
Two Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。