解法之一,家人们,我看不懂,不懂的点就是在for循环里面为什么先判断哈希表中是否存在那个元素,然后再往表里放元素。不应该先放元素再去查找吗?
class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] anser=new int[2];
int len=numbers.length;
HashMap<Integer,Integer> map = new HashMap<>();
for(int i=0;i<len;i++)
{
if(map.get(target-numbers[i])!=null)
{
anser[0]=map.get(target-numbers[i]);
anser[1]=i;
return anser;
}
map.put(numbers[i],i);
}
return anser;
}
}
解法二,双指针法
class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] anser=new int[2];
int len=numbers.length;
int i=0,j=len-1;
while(i<j)
{
if(numbers[i]+numbers[j]>target)
{
j--;
}
else if(numbers[i]+numbers[j]<target)
{
i++;
}
else{
anser = new int[]{i, j};
break;
}
}
return anser;
}
}