From a08f2c7793e9cb2bd4e59560f982f934d4827f36 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 13 Oct 2021 12:12:01 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BB=A3=E7=A0=81=E6=A0=BC=E5=BC=8F=E5=8C=96?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/TwoSumIiInputArrayIsSorted.java | 30 ++++++++++---------
 1 file changed, 16 insertions(+), 14 deletions(-)

diff --git a/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java b/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java
index 2bd0cde..54acee4 100644
--- a/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java
+++ b/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java
@@ -43,30 +43,32 @@
 // 👍 533 👎 0
 
 package leetcode.editor.cn;
+
 //167:两数之和 II - 输入有序数组
-class TwoSumIiInputArrayIsSorted{
+class TwoSumIiInputArrayIsSorted {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new TwoSumIiInputArrayIsSorted().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
-class Solution {
-    public int[] twoSum(int[] numbers, int target) {
-        int start = 0;
-        int end = numbers.length-1;
-        while(start<end){
-            if(numbers[start]+numbers[end]==target){
-                return new int[]{start+1,end+1};
-            }else if (numbers[start]+numbers[end]>target){
-                end--;
-            }else{
-                start++;
+    class Solution {
+        public int[] twoSum(int[] numbers, int target) {
+            int start = 0;
+            int end = numbers.length - 1;
+            while (start < end) {
+                if (numbers[start] + numbers[end] == target) {
+                    return new int[]{start + 1, end + 1};
+                } else if (numbers[start] + numbers[end] > target) {
+                    end--;
+                } else {
+                    start++;
+                }
             }
+            return null;
         }
-        return null;
     }
-}
 //leetcode submit region end(Prohibit modification and deletion)
 
 }
\ No newline at end of file