refactor 132

Author: fishercoder1534

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

@@ -1,6 +1,9 @@
 package com.fishercoder.solutions;
 
-/**Given a string s, partition s such that every substring of the partition is a palindrome.
+/**
+ * 132. Palindrome Partitioning II
+
+ Given a string s, partition s such that every substring of the partition is a palindrome.
 
  Return the minimum cuts needed for a palindrome partitioning of s.
 
@@ -9,32 +12,35 @@
 
  */
 public class _132 {
-    /**This solution is cooler than Jiuzhang: https://discuss.leetcode.com/topic/32575/easiest-java-dp-solution-97-36*/
-    
-    //cut[i] stands for the minimum number of cut needed to cut [0, i] into palindromes
-    //we initiazlie cut[i] with its max possible value which is i, this is because a single char is naturally a palindrome, so, we'll cut this string into all single-char substrings, which is the max cuts needed
-    
-    //dp[j][i] == true stands for s.substring(j,i) is a palindrome
-    public int minCut(String s) {
+
+  /**This solution is cooler than Jiuzhang: https://discuss.leetcode.com/topic/32575/easiest-java-dp-solution-97-36*/
+
+    public static class Solution1 {
+      //cut[i] stands for the minimum number of cut needed to cut [0, i] into palindromes
+      //we initiazlie cut[i] with its max possible value which is i, this is because a single char is naturally a palindrome, so, we'll cut this string into all single-char substrings, which is the max cuts needed
+
+      //dp[j][i] == true stands for s.substring(j,i) is a palindrome
+      public int minCut(String s) {
         int n = s.length();
         char[] c = s.toCharArray();
         boolean[][] dp = new boolean[n][n];
         int[] cut = new int[n];
 
         for (int i = 0; i < n; i++) {
-            cut[i] = i;
-            for (int j = 0; j <= i; j++) {
-                if (c[i] == c[j] && (j + 1 > i - 1 || dp[j + 1][i - 1])) {
-                    dp[j][i] = true;
-                    if (j == 0) {
-                        cut[i] = 0;
-                    } else {
-                        cut[i] = (cut[i] < cut[j - 1] + 1) ? cut[i] : cut[j - 1] + 1;
-                    }
-                }
+          cut[i] = i;
+          for (int j = 0; j <= i; j++) {
+            if (c[i] == c[j] && (j + 1 > i - 1 || dp[j + 1][i - 1])) {
+              dp[j][i] = true;
+              if (j == 0) {
+                cut[i] = 0;
+              } else {
+                cut[i] = (cut[i] < cut[j - 1] + 1) ? cut[i] : cut[j - 1] + 1;
+              }
             }
+          }
         }
 
         return cut[n - 1];
+      }
     }
 }

src/test/java/com/fishercoder/_132Test.java

@@ -0,0 +1,21 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._132;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _132Test {
+  private static _132.Solution1 solution1;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _132.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    assertEquals(1, solution1.minCut("aab"));
+  }
+}