refactor 131

fishercoder1534 · fishercoder1534 · commit 3823914c5dae · 2020-12-14T06:21:15.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_131.java b/src/main/java/com/fishercoder/solutions/_131.java
@@ -3,65 +3,49 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 131. Palindrome Partitioning
-
- Given a string s, partition s such that every substring of the partition is a palindrome.
-
- Return all possible palindrome partitioning of s.
-
- For example, given s = "aab",
- Return
-
- [
- ["aa","b"],
- ["a","a","b"]
- ]
-
- */
 public class _131 {
 
-  public static class Solution1 {
-    public List<List<String>> partition(String s) {
-      List<List<String>> result = new ArrayList();
-      int n = s.length();
-      boolean[][] dp = new boolean[n][n];
-      for (int i = 0; i < n; i++) {
-        for (int j = 0; j <= i; j++) {
-          if (s.charAt(j) == s.charAt(i) && (j + 1 >= i - 1 || dp[j + 1][i - 1])) {
-            // j+1 >= i-1 means j and i are adjance to each other or only one char apart from each other
-            //dp[j+1][i-1] means its inner substring is a palindrome, so as long as s.charAt(j) == s.charAt(i), then dp[j][i] must be a palindrome.
-            dp[j][i] = true;
-          }
+    public static class Solution1 {
+        public List<List<String>> partition(String s) {
+            List<List<String>> result = new ArrayList();
+            int n = s.length();
+            boolean[][] dp = new boolean[n][n];
+            for (int i = 0; i < n; i++) {
+                for (int j = 0; j <= i; j++) {
+                    if (s.charAt(j) == s.charAt(i) && (j + 1 >= i - 1 || dp[j + 1][i - 1])) {
+                        // j+1 >= i-1 means j and i are adjance to each other or only one char apart from each other
+                        //dp[j+1][i-1] means its inner substring is a palindrome, so as long as s.charAt(j) == s.charAt(i), then dp[j][i] must be a palindrome.
+                        dp[j][i] = true;
+                    }
+                }
+            }
+
+            for (boolean[] list : dp) {
+                for (boolean b : list) {
+                    System.out.print(b + ", ");
+                }
+                System.out.println();
+            }
+            System.out.println();
+
+            backtracking(s, 0, dp, new ArrayList(), result);
+
+            return result;
         }
-      }
-
-      for (boolean[] list : dp) {
-        for (boolean b : list) {
-          System.out.print(b + ", ");
-        }
-        System.out.println();
-      }
-      System.out.println();
-
-      backtracking(s, 0, dp, new ArrayList(), result);
-
-      return result;
-    }
 
-    void backtracking(String s, int start, boolean[][] dp, List<String> temp,
-        List<List<String>> result) {
-      if (start == s.length()) {
-        List<String> newTemp = new ArrayList(temp);
-        result.add(newTemp);
-      }
-      for (int i = start; i < s.length(); i++) {
-        if (dp[start][i]) {
-          temp.add(s.substring(start, i + 1));
-          backtracking(s, i + 1, dp, temp, result);
-          temp.remove(temp.size() - 1);
+        void backtracking(String s, int start, boolean[][] dp, List<String> temp,
+                          List<List<String>> result) {
+            if (start == s.length()) {
+                List<String> newTemp = new ArrayList(temp);
+                result.add(newTemp);
+            }
+            for (int i = start; i < s.length(); i++) {
+                if (dp[start][i]) {
+                    temp.add(s.substring(start, i + 1));
+                    backtracking(s, i + 1, dp, temp, result);
+                    temp.remove(temp.size() - 1);
+                }
+            }
         }
-      }
     }
-  }
 }
