[leetcode] 273. Integer to English Words 解题报告
2016-02-25 03:49
471 查看
题目链接:https://leetcode.com/problems/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,
Hint:
Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.
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.
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)
思路:将其划分为几种情况递归处理,billion, million, thousand, hundred, ten, or others,并预先将数字对于的英文存储起来.
代码如下:
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:
Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.
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.
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)
思路:将其划分为几种情况递归处理,billion, million, thousand, hundred, ten, or others,并预先将数字对于的英文存储起来.
代码如下:
class Solution { public: string numberToWords(int num) { if(num == 0) return "Zero"; return convert(num).substr(1); } string convert(int num) { if(num >= 1000000000) return convert(num/1000000000) + " Billion" + convert(num - 1000000000*(num/1000000000)); if(num >= 1000000) return convert(num/1000000) + " Million" + convert(num - 1000000*(num/1000000)); if(num >= 1000) return convert(num/1000) + " Thousand" + convert(num - 1000*(num/1000)); if(num >= 100) return convert(num/100) + " Hundred" + convert(num - 100*(num/100)); if(num >= 20) return " " + above20[num/10-2] + convert(num - 10*(num/10)); if(num >= 1) return " " + below20[num-1]; return ""; } private: string above20[8] = {"Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"}; string below20[19] = {"One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"}; };参考:https://leetcode.com/discuss/57747/fairly-clear-4ms-c-solution
相关文章推荐
- 文章标题
- 论clone深层复制和浅层复制
- 【CSS3】盒子模型
- Hashtable之哈希表一
- jquery中各个事件执行顺序如下:
- IOS Apps 开发(Swift)(3)——Build a Basic UI(2)
- 【CSS3】跨列设置column-span
- 我与小娜(21):引力波振幅是什么?
- 如何使用pyQT做pythonGUI界面?
- Java练笔:一个类作为另一个类的参数调用。顺带训练数据在栈和堆的走向。思考若用C++写,delete应该怎么写
- const修饰类的成员函数
- 【CSS3】列表边框column-rule
- 【CSS3】列间距column-gap
- 一些常用css技巧的为什么(一)我所理解的margin
- 【CSS3】多列布局——column-count
- [leetcode] 128. Longest Consecutive Sequence 解题报告
- 木雕体会
- 【CSS3】多列布局——column-width
- 简易jQuery插件
- 个人进阶之路——自定义控件(3)