代码格式化
This commit is contained in:
parent
9f1ecd6435
commit
a08f2c7793
@ -43,30 +43,32 @@
|
|||||||
// 👍 533 👎 0
|
// 👍 533 👎 0
|
||||||
|
|
||||||
package leetcode.editor.cn;
|
package leetcode.editor.cn;
|
||||||
|
|
||||||
//167:两数之和 II - 输入有序数组
|
//167:两数之和 II - 输入有序数组
|
||||||
class TwoSumIiInputArrayIsSorted{
|
class TwoSumIiInputArrayIsSorted {
|
||||||
public static void main(String[] args) {
|
public static void main(String[] args) {
|
||||||
//测试代码
|
//测试代码
|
||||||
Solution solution = new TwoSumIiInputArrayIsSorted().new Solution();
|
Solution solution = new TwoSumIiInputArrayIsSorted().new Solution();
|
||||||
}
|
}
|
||||||
|
|
||||||
//力扣代码
|
//力扣代码
|
||||||
//leetcode submit region begin(Prohibit modification and deletion)
|
//leetcode submit region begin(Prohibit modification and deletion)
|
||||||
class Solution {
|
class Solution {
|
||||||
public int[] twoSum(int[] numbers, int target) {
|
public int[] twoSum(int[] numbers, int target) {
|
||||||
int start = 0;
|
int start = 0;
|
||||||
int end = numbers.length-1;
|
int end = numbers.length - 1;
|
||||||
while(start<end){
|
while (start < end) {
|
||||||
if(numbers[start]+numbers[end]==target){
|
if (numbers[start] + numbers[end] == target) {
|
||||||
return new int[]{start+1,end+1};
|
return new int[]{start + 1, end + 1};
|
||||||
}else if (numbers[start]+numbers[end]>target){
|
} else if (numbers[start] + numbers[end] > target) {
|
||||||
end--;
|
end--;
|
||||||
}else{
|
} else {
|
||||||
start++;
|
start++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
//leetcode submit region end(Prohibit modification and deletion)
|
//leetcode submit region end(Prohibit modification and deletion)
|
||||||
|
|
||||||
}
|
}
|
Loading…
Reference in New Issue
Block a user