微软高频面试题中文读数字(ACWing1568 中文读数字）

首先需要沟通确认11是读成十一还是一十一。

 

这道题目有一种最朴素的写法就是从简单到复杂：

先实现num1To9的转换

然后实现num1To99， 

然后实现num1To999

然后实现num1To9999

中文是以四个零为单位，也就是万为单位，因此接下来可以直接实现

num1To99999999， 前四位和后四位单独处理。

对于亿位数字，再单独处理下即可，这样思路就特别清晰

#include <iostream>
using namespace std;

string nums[] = {"yi","er","san","si","wu","liu","qi","ba","jiu"};

string num1To9(int num){
    if(num < 1 || num > 9){
        return "";
    }
    return nums[num - 1];
}

string num1To99(int num){
    if(num < 1 || num > 99){
        return "";
    }
    if(num < 10){
        return num1To9(num);
    }
    int shi = num / 10;
    if(num%10 == 0){
        return num1To9(shi) + " Shi";
    }
    return num1To9(shi) + " Shi " + num1To9(num % 10);
}


string num1To999(int num){
    if(num < 1 || num > 999){
        return "";
    }
    if(num < 100){
        return num1To99(num);
    }
    string res = num1To9(num / 100) + " Bai";
    int rest = num % 100;
    if(rest == 0){
        return res;
    }else if(rest >= 10){
        res += " " + num1To99(rest);
    }else{
        res += " ling " + num1To9(rest);
    }
    return res;
}

string num1To9999(int num){
    if(num < 1 || num > 9999){
        return "";
    }
    if(num < 1000){
        return num1To999(num);
    }
    string res = num1To9(num / 1000) + " Qian";
    int rest = num % 1000;
    if(rest == 0){
        return res;
    }else if(rest >= 100){
        res += " " + num1To999(rest);
    }else{
        res += " ling " + num1To99(rest);
    }
    return res;
}

string num1To99999999(int num){
    if(num < 1 || num > 99999999){
        return "";
    }
    int wan = num / 10000;
    int rest = num % 10000;
    if(wan == 0){
        return num1To9999(rest);
    }
    string res = num1To9999(wan) + " Wan";
    if(rest == 0){
        return res;
    }else{
        if(rest < 1000){
            return res + " ling " + num1To9999(rest);
        }else{
            return res + " " + num1To9999(rest);
        }
    }
}

string getNumChiExp(int num)
{
    if(num == 0){
        return "ling";
    }
    string res;
    if(num < 0){
        num = -num;
        res += "Fu ";
    }
    
    int yi = num / 100000000;
    int rest = num % 100000000;
    if(yi == 0){
        return res + num1To99999999(rest);
    }
    res += num1To9999(yi) + " Yi";
    if(rest == 0){
        return res;
    }else{
        if(rest < 10000000){
            return res + " ling " + num1To99999999(rest);
        }else{
            return res + " " + num1To99999999(rest);
        }
    }
}

int main()
{
    int n;
    cin >> n;
    cout << getNumChiExp(n) << endl;
    
}