refactor 167

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_167.java

@@ -32,13 +32,10 @@ public int[] twoSum(int[] numbers, int target) {
                 } else if (sum < target) {
                     left++;
                 } else {
-                    int[] res = new int[2];
-                    res[0] = left + 1;
-                    res[1] = right + 1;
-                    return res;
+                    return new int[]{left + 1, right + 1};
                 }
             }
-            return new int[] {-1, -1};
+            return new int[]{-1, -1};
         }
     }
 }

src/test/java/com/fishercoder/_167Test.java

@@ -7,19 +7,19 @@
 import static org.junit.Assert.assertArrayEquals;
 
 public class _167Test {
-  private static _167.Solution1 solution1;
-  private static int[] numbers;
-  private static int[] expected;
+    private static _167.Solution1 solution1;
+    private static int[] numbers;
+    private static int[] expected;
 
-  @BeforeClass
-  public static void setup() {
-    solution1 = new _167.Solution1();
-  }
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _167.Solution1();
+    }
 
-  @Test
-  public void test1() {
-    numbers = new int[] {-3, 3, 4, 90};
-    expected = new int[] {1, 2};
-    assertArrayEquals(expected, solution1.twoSum(numbers, 0));
-  }
+    @Test
+    public void test1() {
+        numbers = new int[]{-3, 3, 4, 90};
+        expected = new int[]{1, 2};
+        assertArrayEquals(expected, solution1.twoSum(numbers, 0));
+    }
 }