Two Sum II - Input array is sorted思路:弱智题目
GitHub地址:https://github.com/corpsepiges/leetcode
点此进入如果可以的话,请点一下star,谢谢。
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] ans=new int[2];
int s=0;
int e=numbers.length-1;
while (s<e) {
if (numbers[s]+numbers[e]==target) {
ans[0]=s+1;
ans[1]=e+1;
return ans;
}else if(numbers[s]+numbers[e]<target) {
s++;
}else{
e--;
}
}
return null;
}
}