leetcode之twosum问题

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

原题是这样的，大概的意思就是给出一组无序的数组，并给出目标值target，在数组中找到两个数加起来等于target，并且给出两个数在数组中的索引位置，索引1的位置要小于索引2的位置；

下面是代码，我通过hashMap直接实现其功能，当然你也可以重新写个类，里面定义一个类似于 map结构的组成，不过注意的是，你得重新写comparable方法

<span style="font-size:18px;color:#333333;">package num;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class text {

	public static void main(String[] args) {
		Map<Integer,Integer> map=new HashMap<Integer,Integer>();
		int[] arry=new int[]{3,4,5,1,2,9};
		//得到hashmap
		for(int i=0;i<arry.length;i++){
			map.put( i,arry[i]);
		}
		int target=7;
		//设置索引
		int start=0;
		int stop=map.size()-1;
		while(start<stop){
			if(map.get(start)+map.get(stop)==target){
				System.out.println("index1__"+start);
				System.out.println("index2__"+stop);
				break;
				
			}else if(map.get(start)+map.get(stop)>target)
				stop--;
			else
				start++;
		}
	}

}
</span>

最终结果如下：