Leetcode 125. Valid Palindrome | | Leetcode 125. Valid Palindrome 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution12345678910111213141516171819202122232425class Solution {public: bool isPalindrome(string s) { int i = 0; int j = s.length() - 1; while(i < j) { if(!isalnum(s[i])) { i++; continue; } if(!isalnum(s[j])) { j--; continue; } if(tolower(s[i]) == tolower(s[j])) { i++; j--; } else { return false; } } return true; }}; Reference https://leetcode.com/problems/valid-palindrome/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏