"Leetcode-Interview algorithm classic-java Implementation" "125-valid palindrome (back to text verification)"

Source: Internet
Author: User
Tags alphanumeric characters

"125-valid palindrome (back to text verification)" "leetcode-Interview algorithm classic-java Implementation" "All topics Directory Index" Original Question

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
For example,
  "A man, a plan, a canal: Panama"is a palindrome.
  "race a car"is not a palindrome.
  Note:
Are you consider that the string might is empty? This was a good question to ask during a interview.
For the purpose of this problem, we define empty string as valid palindrome.

Main Topic

Given a string, determine whether it is a palindrome string, consider only letters, and ignore case.

Thinking of solving problems

Using the end-to-end pointers, find the first qualifying position, compare them, and if they do the next set of comparisons, the unequal returns false until all the letters are processed.

Code Implementation

Algorithm implementation class

 Public  class solution {     Public Boolean Ispalindrome(String s) {if(s = =NULL) {return false; }intleft =0;intright = S.length ()-1;intDelta =' A '-' A ';CharLCharR while(Left < right) { while(Left < S.length () &&!isalphanumericcharacters (S.charat (left))) {//Find numbers and letters from left to rightleft++; } while(Right >=0&&!isalphanumericcharacters (S.charat (right))) {//Find numbers and letters from right to leftright--; }if(Left < right)                {L = S.charat (left); R = S.charat (right);if(L = = r | | l-r = = Delta | | r-l = = Delta)                    {left++;                right--; }Else{return false; }            }        }return true; }/** * Determine if it is a letter or a number * @param c number to be judged * @return Judging result * *    Private Boolean isalphanumericcharacters(Charc) {returnC >=' 0 '&& C <=' 9 '|| C >=' A '&& C <=' Z '|| C >=' A '&& C <=' Z '; }}
Evaluation Results

  Click on the picture, the mouse does not release, drag a position, release after the new window to view the full picture.

Special Instructions Welcome reprint, Reprint please indicate the source "http://blog.csdn.net/derrantcm/article/details/47651267"

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

"Leetcode-Interview algorithm classic-java Implementation" "125-valid palindrome (back to text verification)"

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.