public class Solution {
public int[] twoSum(int[] numbers, int target) {
int front = 0, end = numbers.length-1;
int sum = numbers[front]+numbers[end];
while(sum!=target) {
if (sum>target) {
end--;
}
else {
front++;
}
sum = numbers[front]+numbers[end];
}
return new int[]{front+1, end+1};
}
}
leetcode 167. Two Sum II - Input array is sorted
最新推荐文章于 2024-07-25 22:17:00 发布