refactor 455

fishercoder1534 · fishercoder1534 · commit 6190943917ce · 2019-04-17T07:54:32.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_455.java b/src/main/java/com/fishercoder/solutions/_455.java
@@ -3,51 +3,50 @@
 import java.util.Arrays;
 
 /**
- * Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.
+ * 455. Assign Cookies
+ *
+ * Assume you are an awesome parent and want to give your children some cookies.
+ * But, you should give each child at most one cookie.
+ * Each child i has a greed factor gi, which is the minimum size of a cookie
+ * that the child will be content with;
+ * and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i,
+ * and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.
 
  Note:
  You may assume the greed factor is always positive.
  You cannot assign more than one cookie to one child.
 
  Example 1:
  Input: [1,2,3], [1,1]
-
  Output: 1
-
  Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3.
  And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
  You need to output 1.
+
  Example 2:
  Input: [1,2], [1,2,3]
-
  Output: 2
-
  Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.
  You have 3 cookies and their sizes are big enough to gratify all of the children,
  You need to output 2.*/
 
 public class _455 {
 
-    public int findContentChildren(int[] g, int[] s) {
-        Arrays.sort(g);
-        Arrays.sort(s);
-
-        int result = 0;
-        for (int i = 0, j = 0; i < g.length && j < s.length; ) {
-            if (s[j] >= g[i]) {
-                result++;
-                i++;
+    public static class Solution1 {
+        public int findContentChildren(int[] g, int[] s) {
+            Arrays.sort(g);
+            Arrays.sort(s);
+
+            int result = 0;
+            for (int i = 0, j = 0; i < g.length && j < s.length; ) {
+                if (s[j] >= g[i]) {
+                    result++;
+                    i++;
+                }
+                j++;
             }
-            j++;
+            return result;
         }
-        return result;
-    }
-
-    public static void main(String... args) {
-        _455 test = new _455();
-        int[] g = new int[]{1, 2, 3};
-        int[] s = new int[]{1, 1};
-        System.out.println(test.findContentChildren(g, s));
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_455Test.java b/src/test/java/com/fishercoder/_455Test.java
@@ -0,0 +1,28 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._455;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+public class _455Test {
+    private static _455.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _455.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.findContentChildren(new int[]{1, 2, 3}, new int[]{1, 1}));
+
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(2, solution1.findContentChildren(new int[]{1, 2}, new int[]{1, 2, 3}));
+
+    }
+}
