From fa26fb332b43cbeec805944f4522472953232487 Mon Sep 17 00:00:00 2001
From: dcj_hp <294487055@qq.com>
Date: Tue, 7 Jun 2022 17:38:37 +0800
Subject: [PATCH] =?UTF-8?q?=E5=A2=9E=E5=8A=A0=20java=20dp=E8=A7=A3?=
 =?UTF-8?q?=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0132.分割回文串II.md | 50 ++++++++++++++++++++++++++++++
 1 file changed, 50 insertions(+)

diff --git a/problems/0132.分割回文串II.md b/problems/0132.分割回文串II.md
index 87d3e4b4..4cb95901 100644
--- a/problems/0132.分割回文串II.md
+++ b/problems/0132.分割回文串II.md
@@ -206,6 +206,55 @@ public:
 ## Java
 
 ```java
+class Solution {
+
+    public int minCut(String s) {
+        if(null == s || "".equals(s)){
+            return 0;
+        }
+        int len = s.length();
+        // 1.
+        // 记录子串[i..j]是否是回文串
+        boolean[][] isPalindromic = new boolean[len][len];
+        // 从下到上，从左到右
+        for(int i = len - 1; i >= 0; i--){
+            for(int j = i; j < len; j++){
+                if(s.charAt(i) == s.charAt(j)){
+                    if(j - i <= 1){
+                        isPalindromic[i][j] = true;
+                    } else{
+                        isPalindromic[i][j] = isPalindromic[i + 1][j - 1];
+                    }
+                } else{
+                    isPalindromic[i][j] = false;
+                }
+            }
+        }
+
+        // 2.
+        // dp[i] 表示[0..i]的最小分割次数
+        int[] dp = new int[len];
+        for(int i = 0; i < len; i++){
+            //初始考虑最坏的情况。 1个字符分割0次， len个字符分割 len - 1次
+            dp[i] = i;
+        }
+
+        for(int i = 1; i < len; i++){
+            if(isPalindromic[0][i]){
+                // s[0..i]是回文了，那 dp[i] = 0, 一次也不用分割
+                dp[i] = 0;
+                continue;
+            }
+            for(int j = 0; j < i; j++){
+                // 按文中的思路，不清楚就拿 "ababa" 为例，先写出 isPalindromic 数组，再进行求解
+                if(isPalindromic[j + 1][i]){
+                    dp[i] = Math.min(dp[i], dp[j] + 1);
+                }
+            }
+        }
+        return dp[len - 1];
+    }
+}
 ```
 
 ## Python
@@ -240,6 +289,7 @@ class Solution:
 ## Go
 
 ```go
+
 ```
 
 ## JavaScript