方法一:暴力枚举
class Solution {
public int[] twoSum(int[] nums, int target) {
int n=nums.length;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(nums[i]+nums[j]==target){
return new int[]{i,j};
}
}
}
return new int [0];
}
}
方法二:哈希表
class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> h=new HashMap<Integer,Integer>();
for(int i=0;i<nums.length;i++){
if(h.containsKey(target-nums[i])){
return new int[]{h.get(target-nums[i]),i};
}
h.put(nums[i],i);
}
return new int [0];
}
}