首页 > 其他 > 详细

125. Valid Palindrome

时间:2017-10-16 22:37:22      阅读:233      评论:0      收藏:0      [点我收藏+]

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:
Have you consider that the string might be empty? This is a good question to ask during an interview.

For the purpose of this problem, we define empty string as valid palindrome.

题目含义:给定一个字符串,判断是不是回文,只考虑字母数字字符,并不顾大小写。另外,空串被认为是有效的回文。

 1     public boolean isPalindrome(String s) {
 2         if (s.isEmpty()) return true;
 3         int begin = 0,end = s.length()-1;
 4         while (begin<=end)
 5         {
 6             Character bchar = s.charAt(begin);
 7             Character echar = s.charAt(end);
 8             if (!Character.isLetterOrDigit(bchar)) begin++;
 9             else if (!Character.isLetterOrDigit(echar)) end--;
10             else if (Character.toLowerCase(bchar) != Character.toLowerCase(echar)) return false;
11             else {
12                 begin++;end--;
13             }
14         }
15         return true;        
16     }

 

125. Valid Palindrome

原文:http://www.cnblogs.com/wzj4858/p/7679091.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!