package suanfa.Max;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(Arrays.toString(soult(new int[]{1,2,3,6,5},11)));
}
public static int[] soult(int nums[],int target){
Map<Integer,Integer> map=new HashMap<Integer,Integer>();
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 new int[0];
}
}
暴力算法的升级版 时间复杂度只有 0(n)