LeetCode题库解答与分析——#12.整数转罗马数字IntegerToRoman
2018-03-17 15:58
387 查看
#12 整数转罗马数字 Integer To Roman
给定一个整数,将其转为罗马数字。输入保证在 1 到 3999 之间。
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.
思路一:
根据罗马数字编码规律对特定的几个数字进行比较并对其编码
代码(JavaScript):/**
* @param {number} num
* @return {string}
*/
var intToRoman = function(num) {
var values = new Array(1000,900,500,400,100,90,50,40,10,9,5,4,1);
var strs = new Array("M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I");
var sb = "";
for(var i=0;i<values.length;i++) {
while(num >= values[i]) {
num -= values[i];
sb+=strs[i];
}
}
return sb;
};
思路二:
记录1-3999中每一位(个位、十位、千位)的罗马数字编码
代码(Java):public static String intToRoman(int num) {
String M[] = {"", "M", "MM", "MMM"};
String C[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
String X[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
String I[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
return M[num/1000] + C[(num%1000)/100] + X[(num%100)/10] + I[num%10];
}
给定一个整数,将其转为罗马数字。输入保证在 1 到 3999 之间。
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.
思路一:
根据罗马数字编码规律对特定的几个数字进行比较并对其编码
代码(JavaScript):/**
* @param {number} num
* @return {string}
*/
var intToRoman = function(num) {
var values = new Array(1000,900,500,400,100,90,50,40,10,9,5,4,1);
var strs = new Array("M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I");
var sb = "";
for(var i=0;i<values.length;i++) {
while(num >= values[i]) {
num -= values[i];
sb+=strs[i];
}
}
return sb;
};
思路二:
记录1-3999中每一位(个位、十位、千位)的罗马数字编码
代码(Java):public static String intToRoman(int num) {
String M[] = {"", "M", "MM", "MMM"};
String C[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
String X[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
String I[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
return M[num/1000] + C[(num%1000)/100] + X[(num%100)/10] + I[num%10];
}
相关文章推荐
- LeetCode题库解答与分析——#7.颠倒整数ReverseInteger
- LeetCode题库解答与分析——#9.回文数PalindromeNumber
- LeetCode题库解答与分析——#91. 解码方法DecodeWays
- LeetCode题库解答与分析——#3.无重复字符的最长子串LongestSubstringWithoutRepeatingCharacters
- LeetCode题库解答与分析——#53.最大子序和MaximumSubarray
- LeetCode题库解答与分析——#62. 不同路径UniquePaths
- LeetCode题库解答与分析——#95. 不同的二叉查找树 IIUniqueBinarySearchTreeII
- LeetCode题库解答与分析——#152. 乘积最大子序列MaximumProductSubarray
- LeetCode题库解答与分析——#1.两数之和TwoSum
- LeetCode题库解答与分析——#5.最长回文子串LongestPalindromicSubstring
- LeetCode题库解答与分析——#63.不同路径IIUniquePathsII
- LeetCode题库解答与分析——#70. 爬楼梯ClimbingStairs
- LeetCode题库解答与分析——#96. 不同的二叉查找树UniqueBinarySearchTree
- LeetCode题库解答与分析——#2.两数相加AddTwoNumbers
- LeetCode题库解答与分析——#120. 三角形最小路径和Triangle
- LeetCode题库解答与分析——#121. 买卖股票的最佳时机BestTimeToBuyAndSellStock
- LeetCode Copy List with Random Pointer 分析解答
- 【LeetCode题意分析&解答】34. Search for a Range
- 【LeetCode题意分析&解答】35. Search Insert Position
- [C++]LeetCode 12: Integer to Roman(将整数转换为罗马数字)