LeetCode 125. Valid Palindrome

最新推荐文章于 2024-10-28 14:06:27 发布

原创最新推荐文章于 2024-10-28 14:06:27 发布 · 100 阅读

0 ·

CC 4.0 BY-SA版权

博客围绕判断字符串是否为回文串展开，只考虑字母数字字符并忽略大小写，还规定空字符串为有效回文串，同时给出了示例。

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

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

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

Example 1:

Input: "A man, a plan, a canal: Panama"
Output: true

Example 2:

Input: "race a car"
Output: false

class Solution {

    //alphanumeric characters:字母或数字
    public boolean isPalindrome(String s) {
        int head = 0;
        int tail = s.length()-1;
        char chead;
        char ctail;
        while(head<tail){
            chead = s.charAt(head);
            ctail = s.charAt(tail);
            if( !Character.isLetterOrDigit(chead) ){
                head++;
            }
            else if( !Character.isLetterOrDigit(ctail) ){
                tail--;
            }
            else{
                if( Character.toLowerCase(chead)!=Character.toLowerCase(ctail) ) return false;     
                head++;
                tail--;
            }
        }
        return true;
    }
    
    
}