Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Comment on

( #3333=superdoc: print w/ replies, xml ) Need Help??
Given the number who have gone before, surely this has been done already, but...


sub fizbin {
  return $_[0] unless ($_[0] and length($_[0]) > 1);
  my @string = (300, unpack("U*", $_[0]), 301);
  my $palstart, $palend;
  my ($bestlen, $beststart, $bestend) = (-1,-1,-1);
  for ($palmid = 1; $palmid < $#string; $palmid++)
  {
    if ($string[$palmid] == $string[$palmid+1])
    { # try even-length palindrome
      ($palstart, $palend) = ($palmid, $palmid+1);
      while ($string[$palend+1] == $string[$palstart-1])
      {
        $palend++; $palstart--;
      }
      if ($bestlen < $palend - $palstart)
      {
          ($bestlen, $bestend, $beststart) =
          ($palend - $palstart, $palend, $palstart);
      }
    }
    # try odd-length palindrome
    ($palstart, $palend) = ($palmid, $palmid);
    while ($string[$palend+1] == $string[$palstart-1])
    {
      $palend++; $palstart--;
    }
    if ($bestlen < $palend - $palstart)
    {
      ($bestlen, $bestend, $beststart) =
          ($palend - $palstart, $palend, $palstart);
    }
  }
  pack("U*", @string[$beststart..$bestend]);
}
It's also unfortunately an O(n^2) algorithm, but my initial O(n) idea turned out to be badly flawed. (Actually, I guess it's O(n*m), where "n" is the length of the input and "m" is the length of the longest palindrome - in the worst case, a string of all the same letter, it'd be O(n^2))

Note that it'll also work on unicode strings, assuming that perl knows that its argument is a unicode string.

-- @/=map{[/./g]}qw/.h_nJ Xapou cets krht ele_ r_ra/; map{y/X_/\n /;print}map{pop@$_}@/for@/

In reply to Re: Finding longest palindrome from a string by fizbin
in thread Finding longest palindrome from a string by BUU

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • Outside of code tags, you may need to use entities for some characters:
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this? | Other CB clients
    Other Users?
    Others studying the Monastery: (8)
    As of 2014-12-28 07:30 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      Is guessing a good strategy for surviving in the IT business?





      Results (179 votes), past polls