LeetCode-012 Integer to Roman
来源：互联网 发布：qq的smtp端口号 编辑：程序博客网 时间：2024/05/16 23:55
Description
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
Analyse
没啥好分析的，水题一道，阿拉伯数字转罗马数字。
Code
class Solution {public: const int value[13]={1000,900,500,400,100,90,50,40,10,9,5,4,1}; const string strs[13]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"}; string intToRoman(int num) { string ans; for (int i=0;i<13;i++) { while (num>=value[i]) { num-=value[i]; ans=ans+strs[i]; } } return ans; }};阅读全文
0 0
- leetcode-012:Integer to Roman
- LeetCode 012 Integer to Roman
- LeetCode 012 Integer to Roman
- [LeetCode]-012-Integer to Roman
- leetcode 012 Integer to Roman
- LeetCode 012 Integer to Roman
- [LeetCode]012-Integer to Roman
- LeetCode 012 Integer to Roman
- LeetCode 012: Integer to Roman
- leetcode-012-Integer to Roman
- LeetCode 012 Integer to Roman
- LeetCode-012 Integer to Roman
- LeetCode Roman to Integer && Integer to Roman
- 【leetcode】Roman to Integer | Integer to Roman
- Leetcode - "Roman to Integer" & "Integer to Roman"
- LeetCode:Roman to Integer,Integer to Roman
- LeetCode Integer to Roman & Roman to Integer
- leetcode - roman to integer & integer to roman
- 静态变量
- HDU1817 Necklace of Beads
- vue父子组件通信
- 赋值问题
- 阿里云centos7使用yum安装mysql的正确姿势
- LeetCode-012 Integer to Roman
- java.net 解决ajax跨域访问问题
- 171.Spring Boot WebSocket：原理篇
- Maven详解
- 文件 I/O字节流
- 【模板】最小公倍数LCM
- 欢迎使用CSDN-markdown编辑器
- Hadoop历史
- [剑指offer]矩阵中的路径
