leetcode-12-Integer to Roman

最新推荐文章于 2019-10-17 09:22:58 发布

carol23333

最新推荐文章于 2019-10-17 09:22:58 发布

阅读量86

点赞数

文章标签：前150

本文链接：https://blog.csdn.net/qq_32147019/article/details/80399980

版权

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: 3
Output: "III"

Example 2:

Input: 4
Output: "IV"

Example 3:

Input: 9
Output: "IX"

Example 4:

Input: 58
Output: "LVIII"
Explanation: C = 100, L = 50, XXX = 30 and III = 3.

Example 5:

Input: 1994
Output: "MCMXCIV"
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

class Solution {
public:
    //c++ 数字转字符 9+'0' 字符转数字 '9'-'0'
    string intToRoman(int num) {
        string ans="";
        unordered_map<int,string> map;//构造哈希表
        map[1]="I";map[5]="V";map[10]="X";map[50]="L";map[100]="C";map[500]="D";map[1000]="M";
        map[4]="IV";map[9]="IX";
        map[40]="XL";map[90]="XC";
        map[400]="CD";map[900]="CM";
        
        int a[]={1,4,5,9,10,40,50,90,100,400,500,900,1000};
        int n=sizeof(a)/sizeof(a[0]);//学习这种求数组个数的方法
        for(int i=n-1;i>=0 && num;i--){
            while(a[i]<=num){
                ans += map[a[i]];
                num-=a[i];
            }
        }
        return ans;
    }
};