一,暴力求值,两层for循环
class Solution {
public int[] twoSum(int[] nums, int target) {
int len = nums.length - 1;
for (int i = 0; i <= len; i++) {
for (int j = i + 1; j <= len; j++) {
if (target == (nums[j] + nums[i])) {
return new int[]{i, j};
}
}
}
return null;
}
}
二.哈希映射
class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<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);
}
return null;
}
}