codeforces 863A && Educational Codeforces Round 29 Quasi-palindrome
来源:互联网 发布:极度干燥 知乎 编辑:程序博客网 时间:2024/06/10 23:02
题目大意:给你一个字符串,让你判断它是否是回文串,如果加上几个前导0能使它回文那么也算是一个回文串
其实普通的回文很好判断,重点是在前导0的情况,如果需要添加前导0,那么原字符串后边肯定也有0,那么我们就将后边的0去掉再判断一下就行了
#include<bits/stdc++.h>using namespace std;int main(){string str,tmp,ans;cin>>str;tmp=str;reverse(tmp.begin(),tmp.end());if(tmp==str){cout<<"YES"<<endl;}else{int flag=0;for(int i=str.size()-1;i>=0;i--){if(str[i]!='0'){ans.push_back(str[i]);flag=1;}else{if(flag) ans.push_back(str[i]);else continue;}}string res;res=ans;reverse(res.begin(),res.end());if(ans==res) cout<<"YES"<<endl;else cout<<"NO"<<endl;}}
阅读全文
0 0
- codeforces 863A && Educational Codeforces Round 29 Quasi-palindrome
- Codeforces 863A Quasi-palindrome
- codeforces 863A Quasi-palindrome
- codeforces 863A 之 Quasi-palindrome
- Educational Codeforces Round 29
- Educational Codeforces Round 29
- Educational Codeforces Round 29
- Educational Codeforces Round 29
- Educational Codeforces Round 29
- Educational Codeforces Round 29
- Educational Codeforces Round 29
- Educational Codeforces Round 5 A
- Educational Codeforces Round 20 A
- Educational Codeforces Round 21 A
- Educational Codeforces Round 23 A
- Educational Codeforces Round 2-C. Make Palindrome
- codeforces Educational Codeforces Round 21 A
- Codeforces - Educational Codeforces Round 14B - s-palindrome(模拟)
- VMware安装CentOS遇到Intel VT-x被禁用问题的解决方法
- iTerm2通过DNS请求泄漏您终端中的一切
- 微信入门开发(java)----第一章:access_token和openid的获取
- python网络爬虫-Email发送
- spring,struts,hibernate,mybatis 源码下载
- codeforces 863A && Educational Codeforces Round 29 Quasi-palindrome
- 解浩佳购物车
- PDF转CAD文件怎么设置输出类型
- rman 0级1级增量备份
- 双路快速排序法
- 用telnet+网址可以连接,但进入telnet后,用open+网址无法连接
- CMAQ搭建教程之netcdf C安装
- 多线程实现卖票的例子
- iOS11: 使用Xcode9后的11条小建议 韩俊强的博客