题目:
解答:
class Solution {
public int[] twoSum(int[] nums, int target) {
if(nums==null || nums.length==0)
{
throw new RuntimeException("nums is blank");
}
Map<Integer, Integer> map = new LinkedHashMap<Integer, Integer>(nums.length);
for(int i=0; i<nums.length; i++)
{
int left = target - nums[i];
if(map.containsKey(left)&& map.get(left)!=i)
{
return new int[]{ map.get(left), i};
}
map.put(nums[i], i);
}
throw new RuntimeException("no index");
}
}
知识点:
LinkedHashMap
//TO DO