leetcode Integer to Roman 难度系数3 3.5
来源：互联网 发布：域名收费标准 编辑：程序博客网 时间：2024/06/04 00:58
Question：
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
public class Solution { public String intToRoman(int num) {StringBuffer result = new StringBuffer();String[] Roman = { "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X","IX", "V", "IV", "I" };int[] number = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };for(int i =0;num!=0;i++){while(num>=number[i]){num-=number[i];result.append(Roman[i]);}}return result.toString();}} 0 0
- leetcode Integer to Roman 难度系数3 3.5
- leetcode Roman to Integer 2.5 难度系数2
- leetcode String to Integer (atoi) 2.3 难度系数2
- 题解——Leetcode 12. Integer to Roman 难度：Medium
- leetcode Reverse Integer 2.2 难度系数2
- 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
- LeetCode:Roman to Integer
- LeetCode: Integer to Roman
- LeetCode: Roman to Integer
- LeetCode Integer to Roman
- LeetCode: Integer to Roman
- LeetCode : Roman to Integer
- [Leetcode] Roman to Integer
- 九度OJ 1085 求root(N, k) -- 二分求幂及快速幂取模
- leetcode ZigZag Conversion 难度系数3 3.3
- leetcode Container With Most Water 难度系数3 3.4
- opencv2.4.8在win7下无法打开摄像头，或者摄像头灰色图像的解决方案
- HDU1143Tri Tiling
- leetcode Integer to Roman 难度系数3 3.5
- leetcode 3Sum 难度系数 3.6
- leetcode 3Sum Closest 难度系数3 3.7
- 黑马程序员--命名空间和索引器小结
- leetcode 4Sum 难度系数3 3.9
- 排序二叉树的构造与遍历
- 二叉搜索树
- C++ 多重继承
- 12款免费与开源的NoSQL数据库介绍
