refactor 516

fishercoder1534 · fishercoder1534 · commit e26aee52ee18 · 2019-06-03T07:48:13.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_516.java b/src/main/java/com/fishercoder/solutions/_516.java
@@ -22,25 +22,26 @@
  */
 public class _516 {
 
-    /**
-     * Inspired by https://discuss.leetcode.com/topic/78603/straight-forward-java-dp-solution
-     * dp[i][j] means the longest palindromic subsequence's length of substring(i, j)
-     * so, in the end, we return dp[0][s.length() - 1] which means the longest palindromic subsequence
-     * of this whole string.
-     */
-    public int longestPalindromeSubseq(String s) {
-        int[][] dp = new int[s.length()][s.length()];
-        for (int i = s.length() - 1; i >= 0; i--) {
-            dp[i][i] = 1;//initialization
-            for (int j = i + 1; j < s.length(); j++) {
-                if (s.charAt(i) == s.charAt(j)) {
-                    dp[i][j] = dp[i + 1][j - 1] + 2;
-                } else {
-                    dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
+    public static class Solution1 {
+        /**
+         * Inspired by https://discuss.leetcode.com/topic/78603/straight-forward-java-dp-solution
+         * dp[i][j] means the longest palindromic subsequence's length of substring(i, j)
+         * so, in the end, we return dp[0][s.length() - 1] which means the longest palindromic subsequence
+         * of this whole string.
+         */
+        public int longestPalindromeSubseq(String s) {
+            int[][] dp = new int[s.length()][s.length()];
+            for (int i = s.length() - 1; i >= 0; i--) {
+                dp[i][i] = 1;//initialization
+                for (int j = i + 1; j < s.length(); j++) {
+                    if (s.charAt(i) == s.charAt(j)) {
+                        dp[i][j] = dp[i + 1][j - 1] + 2;
+                    } else {
+                        dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
+                    }
                 }
             }
+            return dp[0][s.length() - 1];
         }
-        return dp[0][s.length() - 1];
     }
-
 }
diff --git a/src/test/java/com/fishercoder/_516Test.java b/src/test/java/com/fishercoder/_516Test.java
@@ -4,19 +4,19 @@
 import org.junit.BeforeClass;
 import org.junit.Test;
 
-import static junit.framework.Assert.assertEquals;
+import static org.junit.Assert.assertEquals;
 
 public class _516Test {
-    private static _516 test;
+    private static _516.Solution1 solution1;
 
     @BeforeClass
     public static void setup() {
-        test = new _516();
+        solution1 = new _516.Solution1();
     }
 
     @Test
     public void test1() {
-        assertEquals(4, test.longestPalindromeSubseq("bbbab"));
+        assertEquals(4, solution1.longestPalindromeSubseq("bbbab"));
     }
 
 }

Original file line number	Diff line number	Diff line change
`@@ -4,19 +4,19 @@`
`4`	`4`	`import org.junit.BeforeClass;`
`5`	`5`	`import org.junit.Test;`
`6`	`6`
`7`		`-import static junit.framework.Assert.assertEquals;`
	`7`	`+import static org.junit.Assert.assertEquals;`
`8`	`8`
`9`	`9`	`public class _516Test {`
`10`		`- private static _516 test;`
	`10`	`+ private static _516.Solution1 solution1;`
`11`	`11`
`12`	`12`	`@BeforeClass`
`13`	`13`	`public static void setup() {`
`14`		`- test = new _516();`
	`14`	`+ solution1 = new _516.Solution1();`
`15`	`15`	`}`
`16`	`16`
`17`	`17`	`@Test`
`18`	`18`	`public void test1() {`
`19`		`- assertEquals(4, test.longestPalindromeSubseq("bbbab"));`
	`19`	`+ assertEquals(4, solution1.longestPalindromeSubseq("bbbab"));`
`20`	`20`	`}`
`21`	`21`
`22`	`22`	`}`