题解——Leetcode 12. Integer to Roman 难度:Medium
2017-06-14 18:33
507 查看
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
本题的难点主要是罗马数字的书写规则:
零不显示,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"。
class Solution {
public:
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];
}
};
Input is guaranteed to be within the range from 1 to 3999.
本题的难点主要是罗马数字的书写规则:
零不显示,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"。
class Solution {
public:
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 18. 4Sum 难度:Medium
- 题解——Leetcode 406. Queue Reconstruction by Height 难度:Medium
- 题解——Leetcode 11.Container With Most Water 难度:Medium
- 题解——Leetcode 529. Minesweeper 难度:Medium
- 题解——Leetcode 240. Search a 2D Matrix II 难度:Medium
- 题解——Leetcode 442. Find All Duplicates in an Array 难度:Medium
- 题解——Leetcode 241. Different Ways to Add Parentheses 难度:Medium
- LeetCode 12. Integer to Roman 题解(C++)
- 题解——Leetcode 419. Battleships in a Board 难度:Medium
- LeetCode[127. Word Ladder] 题解 难度[medium]
- 题解——Leetcode 2. Add Two Numbers 难度:Medium
- 题解——Leetcode 5. Longest Palindromic Substring 难度:Medium
- 题解——Leetcode 419. Battleships in a Board 难度:Medium
- 题解——Leetcode 6. ZigZag Conversion 难度:Medium
- leetCode 12. Integer to Roman | 字符串 | Medium
- 题解——Leetcode 526. Beautiful Arrangement 难度:Medium
- 题解——Leetcode 8. String to Integer (atoi) 难度:Medium
- 题解——Leetcode 16. 3Sum Closest 难度:Medium
- [leetcode]39. Combination Sum,python实现【Medium难度】
- leetcode题解 || Roman to Integer问题