在线编程：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.

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

#include <stdlib.h>
int take_out_repeat(char *s)
{
    int count=0;
    while(*s != '\0')
    {
        if(*s==*(s+1))
        {
            s++;
            continue;
        }
        s++;
        count++;
    }
    return count-1;
}

main()
{
   printf("%d\n",take_out_repeat("aaabassssnnnna"));
}