Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^2: Challenge: Nearest Palindromic Number

by dragonchild (Archbishop)
on Feb 02, 2005 at 21:00 UTC ( [id://427430]=note: print w/replies, xml ) Need Help??


in reply to Re: Challenge: Nearest Palindromic Number
in thread Challenge: Nearest Palindromic Number

sub build { my ($f, $l) = @_; my $b = reverse $f; substr($b, 0, 1, '') if $l; return $f . $b; } sub palindrate { my $num = shift; my $is_odd = length($num) % 2; my $first = substr( $num, 0, int(length($num)/2 + .5 ) ); my $one = build( $first, $is_odd ); $first += $one < $num ? 1 : -1; my $two = build( $first, $is_odd ); return ((abs($one-$num) < abs($two-$num)) ? $one : $two); }

Being right, does not endow the right to be rude; politeness costs nothing.
Being unknowing, is not the same as being stupid.
Expressing a contrary opinion, whether to the individual or the group, is more often a sign of deeper thought than of cantankerous belligerence.
Do not mistake your goals as the only goals; your opinion as the only opinion; your confidence as correctness. Saying you know better is not the same as explaining you know better.

Replies are listed 'Best First'.
Re^3: Challenge: Nearest Palindromic Number
by tilly (Archbishop) on Feb 03, 2005 at 07:15 UTC
    This works perfectly. :-)

    For those who don't understand it, here's an explanation. Take the first half of the digits and build a palindrome. (Be careful, you need to keep it even/odd in size.) That palindrome is going to be larger or smaller than the original number. Adjust the first half up/down one then build a palindrome on the other side of the original number. One of those two is closest, so take the closer one.

    To truly verify that it works (I'm just giving the handwaving explanation) you'll find that you actually are taking the nearest palindromes to either side in every case except where adding/subtracting from $first changes the number of digits that you have. But the only case where that happens is in 1 and numbers matching the pattern /^1(0*)(0|1)$/. In those cases $one winds up being 100...0001 and $two is wildly off. But in those cases, $one is one of the (possibly 2) acceptable answers, so the algorithm is right again.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://427430]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2024-04-24 18:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found