给出数字在数组中找出一个数字的等式 a+b = target代码,Java代码库,德仔网

代码语言

代码分类

【Java】给出数字在数组中找出一个数字的等式 a+b = target

作者:会飞的章鱼 / 发布于2015/6/2/ 563

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


	public int[] twoSum(int[] nums, int target) {
	 HashMap<Integer, List<Integer>> hash = new HashMap<Integer, List<Integer>>();
	 for(int i=0;i<nums.length;i++){
	 if(!hash.containsKey(nums[i])){
	 List<Integer> list = new ArrayList<Integer>();
	 list.add(i+1);
	 hash.put(nums[i], list);
	 }else{
	 hash.get(nums[i]).add(i+1);
	 }
	 }
	 Iterator<Integer> iterator = hash.keySet().iterator();
	 int[] result= new int[2];
	 while(iterator.hasNext()){
	 Integer key = iterator.next();
	 if(key *2 == target){
	 if(hash.get(key).size() >= 2){
	 result[0]=hash.get(key).get(0);
	 result[1]=hash.get(key).get(1);
	 System.out.println("36 = "+result[0]+" 1 = "+result[1]);
	 return result;
	 }
	 }else{
	 if(hash.containsKey(target-key)){
	 result[0] = hash.get(key).get(0);
	 result[1] = hash.get(target-key).get(0);
	 if(result[0]>result[1]){
	 result[0] = result[0]+result[1];
	 result[1] = result[0]-result[1];
	 result[0] = result[0]-result[1];
	 }
	 System.out.println("48 = "+result[0]+" 1 = "+result[1]);
	 return result;
	 }
	 }
	 }
	 return null;
	 }

试试其它关键字

同语言下

可能有用的

会飞的章鱼贡献的其它代码(11)