[leetcode]leetcode第一题 1. Two Sum java O(n)解法

利用hash，因为给的数据源中可能出现多个相同的数，所以重写equals和hashcode方法，此外利用cloneable加速

public class Solution {
    public int[] twoSum(int[] nums, int target) {
		if (nums == null || nums.length <= 1) {
			return null;
		}
		Map<Num, Num> map = new HashMap<Num, Num>();
		Num num1 = new Num();
		num1.key = nums[0];
		num1.position = 0;
		map.put(num1, num1);
		try {
			for (int i = 1; i < nums.length; i++) {
				Num num = (Num) num1.clone();
				num.key = nums[i];
				num.position = i;
				if (map.containsKey(num))
					continue;
				map.put(num, num);
			}
			for (int i = 0; i < nums.length; i++) {
				int no = nums[i];
				int tar = target - no;
				Num key = (Num) num1.clone();
				key.key = tar;
				key.position = -1;
				Num val = map.get(key);
				if (val == null)
					continue;
				if (val.positions == null) {
					if (val.position != i) {
						int[] res = new int[2];
						res[0] = i<val.position? i:val.position;
                        res[1] = i>val.position? i:val.position;
                        return res;
					}
				}else {
					for (int position:val.positions) {
						if (position != i) {
							int[] res = new int[2];
							res[0] = i<position? i:position;
	                        res[1] = i>position? i:position;
	                        return res;
						}
					}
				}
			}	
		} catch (Exception e) {

		}
        return null;
    }
	
	final class Num implements Cloneable{
		
		public Integer key;
		public int position; 
		public List<Integer> positions;
		
		@Override
		protected Object clone() throws CloneNotSupportedException {
			// TODO Auto-generated method stub
			Num num = (Num) super.clone();
			num.positions = null;
			return num;
		}

		@Override
		public boolean equals(Object arg0) {
			// TODO Auto-generated method stub
			Num num = (Num) arg0;
			if (num.key.equals(key)) {
				if (num.positions == null) {
					num.positions = new ArrayList<Integer>();
					num.positions.add(num.position);
				}
				if (!num.positions.contains(position)&&position>=0) {
					num.positions.add(position);
				}
				return true;
			}
			return false;
		}

		@Override
		public int hashCode() {
			// TODO Auto-generated method stub
			return key.hashCode();
		}
		
	}
}