leetcode - Integer to English Words

题目：

Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.

For example,

123 -> "One Hundred Twenty Three"
12345 -> "Twelve Thousand Three Hundred Forty Five"
1234567 -> "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"

Hint:

1. Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.
2. Group the number by thousands (3 digits). You can write a helper function that takes a number less than 1000 and convert just that chunk to words.
3. There are many edge cases. What are some good test cases? Does your code work with input such as 0? Or 1000010? (middle chunk is zero and should not be printed out)

class Solution {
public:

	string numberToWords(int num) {
		if (num<0)
			return "";
		if (num == 0)
			return "Zero";//注意大写
		map<int, string> wei;
		wei[0] = "";
		wei[1] = "Thousand";
		wei[2] = "Million";
		wei[3] = "Billion";
		vector<string> ones = { "", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine" };
		vector<string> tens = { "", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety" };
		vector<string> shiji = { "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen" };
		string number = to_string(num);
		vector<string> n = split_string(number);
		string res= numberToWords(n, wei, ones, tens, shiji);
		//去掉头尾空格
		while(res[0]==' ')
		    res.erase(res.begin());
		while(res[res.size()-1]==' ')
		    res.erase(res.end()-1);
		  return res;
	}

	vector<string> split_string(string &number)
	{
		int i =number.size()-1 ;
		vector<string> res;
		//注意分割的方式
		while (i>=0)
		{
			int begin = max(i - 3, -1);
			string item(number.begin() + begin+1, number.begin() + i+1);
			res.push_back(item);
			i -= 3;
		}
		return res;
	}

	string numberToWords(vector<string> &n, map<int, string> &wei, vector<string> &ones, vector<string> &tens, vector<string> &shiji)
	{
		string res;
		for (int i = n.size() - 1; i >= 0; --i)
		{

			string value = read3(n[i], ones, tens, shiji);
			if (value.empty())
				continue;
			else
				res += " " + value + " " + wei[i];
		}
		return res;
	}

    //num有3位
	string read3(string num, vector<string> &ones, vector<string> &tens, vector<string> &shiji)
	{
		string res;
		//去掉开头的零
		while (num.size()>0 && *num.begin() == '0')
			num.erase(num.begin());
		if (num.size() <= 2)
			return read2(num, ones, tens, shiji);
		else
		{
			res = ones[num[0]-'0'] + " Hundred";
			string res2 = read2(num.substr(1, 2), ones, tens, shiji);
			if (!res2.empty())
				res += " " + res2;
		}
		return res;
	}

    //num有2位
	string read2(string num, vector<string> &ones, vector<string> &tens, vector<string> &shiji)
	{
		string res;
	    //去掉开头的零
		while (num.size()>0 && *num.begin() == '0')
			num.erase(num.begin());
		//分情况讨论
		if (num.size() == 1)
		{
			res = ones[num[0] - '0'];
		}
		else if (num.size() == 2)
		{
		    if (num[0] == '1')
				res = shiji[num[1] - '0'];
			else
			{
				if (num[1] == '0')
					res = tens[num[0] - '0'];
				else
					res = tens[num[0] - '0'] + " " + ones[num[1] - '0'];
			}
		}
		return res;
	}

};