leetcode Question No 132: palindrome 2

July 16, 2015

Problem statement:

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.

For example, given s = "aab",
Return 1 since the palindrome partitioning ["aa","b"] could be produced using 1 cut.

Read the blogs:

http://blog.csdn.net/fightforyourdream/article/details/17730939

Share C# code:

https://github.com/jianminchen/palindromeII/blob/master/Program.cs

January 2, 2016
Review the source code, and try to figure out the algorithm.