golang力扣leetcode 132.分割回文串II

package main
func minCut(s string) int {
  dp := make([]int, len(s)+1)
  for i := 0; i <= len(s); i++ {
    dp[i] = i - 1
    for j := 0; j < i; j++ {
      if isPalindrome(s, j, i-1) {
        dp[i] = min(dp[i], dp[j]+1)
      }
    }
  }
  return dp[len(s)]
}
func isPalindrome(s string, i, j int) bool {
  for i < j {
    if s[i] == s[j] {
      i++
      j--
    } else {
      return false
    }
  }
  return true
}
func min(a, b int) int {
  if a > b {
    return b
  }
  return a
}