LeetCode12. Integer to Roman
来源:互联网 发布:魔兽世界 70数据库 编辑:程序博客网 时间:2024/05/16 00:38
题目链接:
https://leetcode.com/problems/integer-to-roman/
题目描述:
将一个整数转化成罗马数字字符串。
题目分析:
【罗马数字】
1~9: {“I”, “II”, “III”, “IV”, “V”, “VI”, “VII”, “VIII”, “IX”};
10~90: {“X”, “XX”, “XXX”, “XL”, “L”, “LX”, “LXX”, “LXXX”, “XC”};
100~900: {“C”, “CC”, “CCC”, “CD”, “D”, “DC”, “DCC”, “DCCC”, “CM”};
1000~3000: {“M”, “MM”, “MMM”}.
个位十位百位千位,分成4组。用vector<vector<string>>
代码:
class Solution {public: vector<vector<string>> roman = { {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}, {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}, {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}, {"", "M", "MM", "MMM"} }; string intToRoman(int num) { string result=""; int cnt=0; while(num){ result=roman[cnt++][num%10]+result; num/=10; } return result; }};
0 0
- LeetCode12: Integer to Roman
- [LeetCode12]Integer to Roman
- leetcode12 Integer to Roman
- leetcode12 Integer to Roman
- LeetCode12:Integer to Roman
- LeetCode12. Integer to Roman
- leetcode12 Integer to Roman
- Leetcode12. Integer to Roman
- LeetCode12:Integer to Roman
- leetcode12. Integer to Roman
- LeetCode12. Integer to Roman
- leetcode12. Integer to Roman
- LeetCode12. Integer to Roman不用任何数据结构和数组
- LeetCode12~14 Integer to Roman/Roman to Integer/Longest Common Prefix
- Integer to Roman & Roman to Integer
- Integer to Roman & Roman to Integer
- LeetCode Roman to Integer && Integer to Roman
- 【leetcode】Roman to Integer | Integer to Roman
- [Apache Kafka]开发producer
- MyEclipse中没有支持tomcat7.x时候怎么使用Tomcat7
- maven常用命令和网址
- 单链表中是否有环(长度和连接点)
- JFrame放置背景图片
- LeetCode12. Integer to Roman
- cvpr2014显著性相关论文
- uva 297 四分树
- Android学习笔记之AppWidget
- iOS 开发学习之 User Interface(6)UITextField 与 UIImageView
- op08-bash scripts config files
- Hive UDF教程(一)
- 算法-蓝桥杯习题(4-1)
- 《Natural Language Processing》斯坦福视频学习笔记——3.编辑距离