refactor 561

fishercoder1534 · fishercoder1534 · commit 0e360df17396 · 2019-07-03T09:19:00.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_561.java b/src/main/java/com/fishercoder/solutions/_561.java
@@ -24,13 +24,15 @@
  All the integers in the array will be in the range of [-10000, 10000].*/
 public class _561 {
 
-    public int arrayPairSum(int[] nums) {
-        Arrays.sort(nums);
-        int sum = 0;
-        for (int i = 0; i < nums.length; i += 2) {
-            sum += nums[i];
+    public static class Solution1 {
+        public int arrayPairSum(int[] nums) {
+            Arrays.sort(nums);
+            int sum = 0;
+            for (int i = 0; i < nums.length; i += 2) {
+                sum += nums[i];
+            }
+            return sum;
         }
-        return sum;
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_561Test.java b/src/test/java/com/fishercoder/_561Test.java
@@ -10,21 +10,21 @@
  * Created by fishercoder on 4/23/17.
  */
 public class _561Test {
-    private static _561 test;
+    private static _561.Solution1 solution1;
     private static int expected;
     private static int actual;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new _561();
+        solution1 = new _561.Solution1();
     }
 
     @Test
     public void test1() {
         nums = new int[]{1, 4, 3, 2};
         expected = 4;
-        actual = test.arrayPairSum(nums);
+        actual = solution1.arrayPairSum(nums);
         assertEquals(expected, actual);
     }
 
