Leetcode 125 Valid Palindrome

最新推荐文章于 2019-07-24 17:09:09 发布

pessis1

最新推荐文章于 2019-07-24 17:09:09 发布

阅读量189

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode Double Pointers

本文链接：https://blog.youkuaiyun.com/pessis1/article/details/73295248

Leetcode 同时被 2 个专栏收录

167 篇文章

订阅专栏

Double Pointers

3 篇文章

订阅专栏

本文介绍了一种使用双指针技术来判断字符串是否为回文的方法，重点在于只考虑字母数字字符并忽略大小写。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

双指针。

傻呵呵的。Character的method拿着用啊。

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