refactor 441

fishercoder1534 · fishercoder1534 · commit 7b0a2f9ba8f7 · 2019-04-03T07:50:13.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_441.java b/src/main/java/com/fishercoder/solutions/_441.java
@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
 /**
+ * 441. Arranging Coins
+ *
  * You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
 
  Given n, find the total number of full staircase rows that can be formed.
@@ -32,26 +34,24 @@
  Because the 4th row is incomplete, we return 3.*/
 public class _441 {
 
-    public static int arrangeCoins(int n) {
-        if (n < 2) {
-            return n;
+    public static class Solution1 {
+        public int arrangeCoins(int n) {
+            if (n < 2) {
+                return n;
+            }
+            int row = 0;
+            int count = 0;
+            long sum = 0;
+            while (sum < n) {
+                row += 1;
+                sum += row;
+                count++;
+            }
+            if (sum == n) {
+                return count;
+            }
+            return count - 1;
         }
-        int row = 0;
-        int count = 0;
-        long sum = 0;
-        while (sum < n) {
-            row += 1;
-            sum += row;
-            count++;
-        }
-        if (sum == n) {
-            return count;
-        }
-        return count - 1;
     }
 
-    public static void main(String... args) {
-        int n = 3;//should be 2
-        System.out.println(arrangeCoins(n));
-    }
-}
+}
diff --git a/src/test/java/com/fishercoder/_441Test.java b/src/test/java/com/fishercoder/_441Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._441;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _441Test {
+    private static _441.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _441.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.arrangeCoins(3));
+    }
+
+}
