very , very small optimization :p
public static boolean isPalindrome(String input) { char[] charArray = input.toCharArray(); int cursor = 0; int max = input.length() - 1; while(cursor <= max && charArray[cursor] == charArray[max-cursor]) { cursor++; } return cursor > max; }
if by any chance you can benchmark the 2 versions : me very glad ;)
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
very , very small optimization :p
if by any chance you can benchmark the 2 versions : me very glad ;)