您的位置 首页 JAVA(2017)

LeetCode – 125. Valid Palindrome

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.

比较简单的双指针,适合练习

public class Solution {
    public boolean isPalindrome(String s) {
        if(s.length() == 0) return true;
        int l = s.length()-1;
        int i = 0;
        while(i<=l){
            if(!Character.isLetterOrDigit(s.charAt(i))){
                i++;
            }
            else if(!Character.isLetterOrDigit(s.charAt(l))){
                l--;
            }
            else {
                if(Character.toLowerCase(s.charAt(i)) != Character.toLowerCase(s.charAt(l))){
                    return false;
                }
                i++;
                l--;               
            }

        }
        return true;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 125. Valid Palindrome》

发表评论

电子邮件地址不会被公开。

返回顶部