Palindrome Partitioning

Правка en1, от Z0RR0, 2016-09-11 08:44:44

is there any O(n) or O(nlogn) solution to find minimum number of partition of a string where each partition is a palindrome ? there is simple O(n^2) dp solution for this. but is there any greedy insight or any better solution to make it better than the normal dp solution ?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Z0RR0 2016-09-11 08:44:44 296 Initial revision (published)