码迷,mamicode.com
首页 > 其他好文 > 详细

[Leetcode] Valid Palindrome

时间:2014-10-19 04:49:48      阅读:165      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   io   os   ar   for   strong   sp   

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.

Solution:

public class Solution {
    public boolean isPalindrome(String s) {
        s=s.toLowerCase();
        for(int i=0,j=s.length()-1;i<j;++i,--j){
            while(i<j&&!isValid(s.charAt(i)))
                i++;
            while(i<j&&!isValid(s.charAt(j)))
                j--;
            if(s.charAt(i)!=s.charAt(j))
                return false;
        }
        return true;
    }

    private boolean isValid(char c) {
        // TODO Auto-generated method stub
        if(c>=‘a‘&&c<=‘z‘)
            return true;
        if(c>=‘0‘&&c<=‘9‘)
            return true;
        return false;
    }
}

 

[Leetcode] Valid Palindrome

标签:style   blog   color   io   os   ar   for   strong   sp   

原文地址:http://www.cnblogs.com/Phoebe815/p/4034172.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!