Untitled
unknown
plain_text
3 years ago
441 B
9
Indexable
def split_into_palindromes(s, k):
n = len(s)
if k == 1:
return s == s[::-1]
if n == 1:
return True
else:
for i in range(n):
A = s[0:(i+1)]
if A == A[::-1]:
if split_into_palindromes(s[i + 1:], k - 1):
print(s[:i+1])
print(s[i + 1:])
return True
return False
s='BUBBASEESABANANA'
print(split_into_palindromes(s,3))
print(split_into_palindromes(s,2))Editor is loading...