By mswatcher
via davidoncode.blogspot.com.au
Published: Mar 14 2013 / 10:00
This is a non optimal (see below for optimal solution), but much easier to understand solution. It uses the following algorithm. At a position of the string, it compares the character at the left and right to see if they're the same. If they are, it looks one character further out on each side and compares them. And so on until it reaches an end of the string or finds the two characters are different.
-
Android SDK: Create a Book Scanning App
-
Why it's a good idea to roll your own CSS Framework (and why I did it)
-
OpenShift Lightning Talk: Getting Your OpenShift Cartridge Certified
-
Algorithms from the Book. - Theoretical Computer Science
-
Working With Inherited Collections In AngularJS
-
Posting form data using Ajax in CodeIgniter
Add your comment
