Solution to http://www.geeksforgeeks.org/dynamic-programming-set-17-palindrome-partitioning/

Ex1-C Lista2 Algoritmos

def is_palindrome(palavra):
    return palavra[::-1] == palavra


def palindrome(texto):
    if len(texto) <= 1:
        return 0
    res_pal = is_palindrome(texto)
    if res_pal is True:
        return 0

    M = dict()
    M[0] = 0

    for j in range(1, len(texto)):
        values = []

        if is_palindrome(texto[0: j + 1]) is True:
            M[j] = 0
        else:
            for i in range(0, j):
                if is_palindrome(texto[i + 1: j + 1]) is True:
                    values.append(M[i] + 1)

        
            M[j] = min(values)

    return M[len(texto) - 1]

if __name__ == "__main__":
    print palindrome("abbadanilo")