You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
/*/*******************************************************************************
|
|
|
|
|
|
** **
|
|
|
|
|
|
** Jiedi(China nanjing)Ltd. **
|
|
|
|
|
|
** 创建：丁宋涛 夏曹俊，此代码可用作为学习参考 **
|
|
|
|
|
|
*******************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************FILE INFOMATION***********************************
|
|
|
|
|
|
**
|
|
|
|
|
|
** Project : 算法设计与编程实践---基于leetcode的企业真题库
|
|
|
|
|
|
** Contact : xiacaojun@qq.com
|
|
|
|
|
|
** 博客 : http://blog.csdn.net/jiedichina
|
|
|
|
|
|
** 视频课程 : 网易云课堂 http://study.163.com/u/xiacaojun
|
|
|
|
|
|
腾讯课堂 https://jiedi.ke.qq.com/
|
|
|
|
|
|
csdn学院 https://edu.csdn.net/course/detail/25037
|
|
|
|
|
|
** 51cto学院 http://edu.51cto.com/lecturer/index/user_id-100013755.html
|
|
|
|
|
|
** 老夏课堂 http://www.laoxiaketang.com
|
|
|
|
|
|
**
|
|
|
|
|
|
** 算法设计与编程实践---基于leetcode的企业真题库 课程群 ：296249312 加入群下载代码和交流
|
|
|
|
|
|
** 微信公众号 : jiedi2007
|
|
|
|
|
|
** 头条号 : 夏曹俊
|
|
|
|
|
|
**
|
|
|
|
|
|
*****************************************************************************
|
|
|
|
|
|
//！！！！！！！！！ 算法设计与编程实践---基于leetcode的企业真题库 课程 QQ群：296249312 下载代码和交流*/
|
|
|
|
|
|
/*
|
|
|
|
|
|
* @lc app=leetcode.cn id=125 lang=cpp
|
|
|
|
|
|
*
|
|
|
|
|
|
* [125] 验证回文串
|
|
|
|
|
|
*/
|
|
|
|
|
|
#include <string>
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
class Solution {
|
|
|
|
|
|
public:
|
|
|
|
|
|
bool isAlphaNum(char &ch){
|
|
|
|
|
|
if(ch>='a' && ch<='z')
|
|
|
|
|
|
return true;
|
|
|
|
|
|
if(ch>='A' && ch<='Z')
|
|
|
|
|
|
return true;
|
|
|
|
|
|
if(ch>='0' && ch<='9')
|
|
|
|
|
|
return true;
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
bool isPalindrome(string s) {
|
|
|
|
|
|
int left = 0;
|
|
|
|
|
|
int right = s.size() -1;
|
|
|
|
|
|
while(left<right){
|
|
|
|
|
|
if(!isAlphaNum(s[left])){
|
|
|
|
|
|
++left;
|
|
|
|
|
|
}else if(!isAlphaNum(s[right])){
|
|
|
|
|
|
--right;
|
|
|
|
|
|
}else if((s[left]+32-'a')%32 != (s[right]+32-'a')%32)
|
|
|
|
|
|
return false;
|
|
|
|
|
|
else{
|
|
|
|
|
|
++left;
|
|
|
|
|
|
--right;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
