Valid Palindrome

最新推荐文章于 2024-01-04 12:53:14 发布

a83610312

最新推荐文章于 2024-01-04 12:53:14 发布

阅读量937

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/a83610312/article/details/11020053

LeetCode 专栏收录该内容

74 篇文章

订阅专栏

本文介绍了一个C++实现的算法，用于判断输入字符串是否为回文，仅考虑字母和数字字符并忽略大小写。该算法首先移除所有非字母数字字符，然后通过双指针技术从两端向中间比较字符，确保即使包含特殊字符也能正确识别回文。

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.

class Solution {
public:
    bool isPalindrome(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
    	int n =s.length();
		int l=0,r=n-1;
		while(l<=r)
		{
			while(l<=r&&!isalnum(s[l]))
				l++;
			while(l<=r&&!isalnum(s[r]))
				r--;
			if ( l> r)
				break;
			if (isdigit(s[l]) && s[l]!=s[r] )
				return false;
			if ( tolower(s[l])!=tolower(s[r]))
				return false;
			l++,r--;
		}
		return true;
    }
};