public static int[] twoSum01(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return null;
}
int n = a.length;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] + a[j] == target) {
return new int[]{i, j};
}
}
}
return null;
}
public static int[] twoSum02(int[] nums, int target) {
return mapSolution02(nums, target);
}
// 倒推法
private static int[] mapSolution02(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i);
}
for (int i = 0; i < nums.length; i++) {
int num = target - nums[i];
// 判断num是否存在,如果已经存在,则直接返回
if (map.get(num) != null) {
return new int[]{map.get(num), i};
}
}
return null;
}
public static int[] twoSum03(int[] nums, int target) {
return mapSolution03(nums, target);
}
// 倒推法
private static int[] mapSolution03(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int num = target - nums[i];
// 判断num是否存在,如果已经存在,则直接返回
if (map.get(num) != null) {
return new int[]{map.get(num), i};
}
// 不存在则当前数值与序号的映射关系存入map中
map.put(nums[i], i);
}
return null;
}