LeetCode 12. Integer to Roman
2016-04-14 16:27
375 查看
题目链接:https://leetcode.com/problems/integer-to-roman/
题目内容:
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
题目分析:简单粗暴的打表,然后从高到低遍历num的每个位,找出对应的字符串append到结果中去。
题目内容:
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
题目分析:简单粗暴的打表,然后从高到低遍历num的每个位,找出对应的字符串append到结果中去。
class Solution { public: string intToRoman(int num) { if(num < 1 || num > 3999) return ""; string m[][10] = { {"", "M", "MM", "MMM"}, {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}, {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}, {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"} }; string str = ""; for(int i = 0, base = 1000; i < 4; ++i) { str += m[i][num/base]; num %= base; base /= 10; } return str; } };
相关文章推荐
- Android onTouchEvent和onInterceptTouchEvent事件分发详解(三)
- java反射机制
- 头文件和库文件有何区别和联系
- AndroidStudio导入HelloCharts的Module
- RTL行为级仿真、综合后门级功能仿真和时序仿真
- AngularJS 知识总结
- 对10个随机数求和(5)
- Linux系统是否能够联网
- n个随机数得排列
- 大叔讲框架《跟谁学》点播课程列表
- 唯一id UUID
- 一致性的3种协议,并发,事务
- 一加一加到无穷
- ionic2学习文档
- Java接口
- Android项目使用Dagger2进行依赖注入
- 解决 SOAP-ERROR: Parsing WSDL: Couldn't load from 问题
- 【Java】Socket入门 [一]
- CQOI2016 day2 模拟赛总结
- html5摇一摇功能的实现