力扣125. 验证回文串(双指针、内置函数)
https://leetcode-cn.com/problems/valid-palindrome/
给定一个字符串,验证它是否是回文串,只考虑字母和数字字符,可以忽略字母的大小写。
说明:本题中,我们将空字符串定义为有效的回文串。
示例 1:
输入: "A man, a plan, a canal: Panama"
输出: true
示例 2:
输入: "race a car"
输出: false
按照题目去判断就行了
#include "stdafx.h"
#include <string>
#include <iostream>
using namespace std;
class Solution
{
public:
bool isPalindrome(string s)
{
int low = 0;
int high = s.size() - 1;
while (low < high)
{
//只检查字母和数字字符
if (('0' <= s[low] && s[low] <= '9') || ('A' <= s[low] && s[low] <= 'Z') || ('a' <= s[low] && s[low] <= 'z'))
{
}
//如果遇到不是字母和数字字符,跳过
else
{
low++;
continue;
}
//只检查字母和数字字符
if (('0' <= s[high] && s[high] <= '9') || ('A' <= s[high] && s[high] <= 'Z') || ('a' <= s[high] && s[high] <= 'z'))
{
}
//如果遇到不是字母和数字字符,跳过
else
{
high--;
continue;
}
//匹配字符,忽略字母的大小写
if (s[low] == s[high] || (('a' <= s[low] && s[low] <= 'z') &&(s[low] - s[high]) == 32) || (('a' <= s[high] && s[high] <= 'z') && ((s[high] - s[low]) == 32)))
{
cout << "正确:" << s[low] << "==" << s[high] << '\n';
low++;
high--;
continue;
}
else
{
cout << "错误:" << s[low] << "!=" << s[high] << '\n';
return false;
}
}
return true;
}
};
int main()
{
Solution s;
string str = "0P";
auto result = s.isPalindrome(str);
return 0;
}
针对字符,c++的几个内置函数
islower(char c) 是否为小写字母
isuppper(char c) 是否为大写字母
isdigit(char c) 是否为数字
isalpha(char c) 是否为字母
isalnum(char c) 是否为字母或者数字
toupper(char c) 字母小转大
tolower(char c) 字母大转小