【PAT】1005 Spell It Right (20 分)——字符串处理

//要么处理字符串,要么就数字分解,都想到了没有有效组合
//我的解法1:加法结果还是int,最后逆序分解数字,按序插入

#include <iostream>
#include <string>
using namespace std;

string num[10]={"zero","one","two","three","four","five",
"six","seven","eight","nine"};

int main(){
  string N;
  getline(cin,N);

  int sum=0;
  for(int i=0;i<N.length();i++){
    sum+=(N[i]-'0');
  }

  int space_flag=0;
  int a=sum,b;
  string res="";

  if(a==0) res="zero";//不优雅,竟然还有特判

  while(a){
    b=a%10;
    if(space_flag) res.insert(0,num[b]+" ");
    else{
      res.insert(0,num[b]);
      space_flag=1;
    }
    a=a/10;
  }

  cout<<res;

  return 0;
}

//我的解法2：加法结果还是int,最后逆序分解数字,再reverse容器
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string num[10]={"orez","eno","owt","eerht","ruof","evif",
"xis","neves","thgie","enin"};

int main(){
  string N;
  getline(cin,N);

  int sum=0;
  for(int i=0;i<N.length();i++){
    sum+=(N[i]-'0');
  }

  int space_flag=0;
  int a=sum,b;
  string res="";
    
 if(a==0) res="orez";//特判
  while(a){
    b=a%10;
    if(space_flag) res+=(" "+num[b]);
    else{
      res+=num[b];
      space_flag=1;
    }
    a=a/10;
  }

  reverse(res.begin(),res.end());

  cout<<res;

  return 0;
}

//柳姐解法,柳姐喜欢hash
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string num[10]={"zero", "one", "two", "three", "four", "five", "six",
"seven", "eight", "nine"};

int main(){
  string N;
  getline(cin,N);

  int sum=0;
  for(int i=0;i<N.length();i++){
    sum+=(N[i]-'0');
  }

 string res=to_string(sum);//to_string()在PAT是可以用的

  cout<<num[res[0]-'0'];//柳姐不用space_flag
  for(int i=1;i<res.length();i++){
    cout<<" "<<num[res[i]-'0'];
  }

  return 0;
}

总体利用字符串处理还是可读性比较强，而且逻辑简洁。