1019. General Palindromic Number (20):留有疑惑

来源：互联网发布：升降调软件编辑：程序博客网时间：2024/06/06 10:39

如果将 int型数组S[ ] 改为 string类型 S 测试点 2 4 5 错误; 如果添加上判断 N是否为0 测试点2 4 错误; 调了好久参考了网上的代码其中未判断N是否为0也完全正确了百思不得解···先保留着日后再看, 同时望各位仁兄指点一下谢谢.

AC代码:

#include<iostream>#include<vector>#include<cmath>#include<string>#include<algorithm>#include<iomanip>#include<map>using namespace std;#define Max 100000int index;void conversion(int N, int D, int S[]){    index=0;    while(N)    {        S[index++]=(N%D);        N/=D;    }}bool isPalindrom(int S[]){    for(int i=0; i<index/2; i++)        if(S[i]!=S[index-1-i])            return false;    return true;}int main(){    int N, D;    while(cin>>N>>D)    {        int S[Max];        conversion(N, D, S);        if(isPalindrom(S))            cout<<"Yes"<<endl;        else            cout<<"No"<<endl;        for(int i=index-1; i>0; i--)            cout<<S[i]<<" ";        cout<<S[0]<<endl;    }    return 0;}

博主原思路代码:

#include<iostream>#include<vector>#include<cmath>#include<string>#include<algorithm>#include<iomanip>#include<map>using namespace std;#define Max 1000string conversion(int N, int D){    string S;    while(N)    {        S+=(N%D)+'0';        N/=D;    }    reverse(S.begin(),S.end());    return S;}bool isPalindrom(string S){    for(int i=0; i<S.size(); i++)        if(S[i]!=S[S.size()-1-i])            return false;    return true;}int main(){    int N, D;    cin>>N>>D;    //while(cin>>N>>D)    //{//        if(N==0)//        {//            cout<<"Yes"<<endl;//            cout<<"0"<<endl;//            continue;//        }        string S=conversion(N,D);        if(isPalindrom(S))            cout<<"Yes"<<endl;        else            cout<<"No"<<endl;        for(int i=0; i<S.size(); i++){            if(i)                cout<<" ";            cout<<S[i];        }        cout<<endl;    //}    return 0;}

0 0