It means that the position arr[i][j] (read str.substr(i,j)) is a palindrome if the characters at positions i and j are equal (str.charAt(i) == str.charAt(j)) and the word without the last characters were a palindrome (arr[i-1][j-1]). This is a bottom-up approach.
-- barata On Nov 28, 6:02 am, John <[EMAIL PROTECTED]> wrote: > What does arr[i+1][j-1] signify ? > Can u give a pseudocode ? > > On Nov 28, 1:17 pm, "Yingjie Xu" <[EMAIL PROTECTED]> wrote: > > > Using suffix tree, can be solved in O(n)... > > > On 11/28/07, John <[EMAIL PROTECTED]> wrote: > > > > Algorithm for finding out the longest palindrome in a given string > > > using dynamic programming --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
