[LeetCode 12] Integer to Roman

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

Ideas: based on the roman and integer relationship. We could set up a table from bigger to smaller to check the value.

class Solution {
public:
    string intToRoman(int num) {
        string s ;
        if(num<1 || num >3999) return s;  
        
        int  Integer[13] =   {1000,  900, 500,  400,  100,  90,   50,   40,    10,    9,    5,     4,   1};  
        string Roman[13] =   {"M", "CM", "D", "CD",  "C",  "XC",  "L", "XL",   "X",  "IX", "V",  "IV", "I"};  
      
          
        for( int i = 0; i < 13; i++){  
                while(num >= Integer[i]){  
                    num -= Integer[i];  
                    s += Roman[i];  
            }  
        }  
      return s; 
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值