private static int[] regionDistribution(int[] nums ,int target) { //利用hashmap如果预期值与数组任意数相减 满足 条件,返回,不满足存入。 Map<Integer,Integer> map =new HashMap<>(); for (int i = 0; i <nums.length ; i++) { if (map.containsKey(target-nums[i])){ return new int[]{map.get(target-nums[i]),i}; } map.put(nums[i],i); } try { throw new IllegalAccessException("不存在"); } catch (IllegalAccessException e) { e.printStackTrace(); } return null; }