LeetCode 简单操作 | 12. Integer to Roman

/*
 * Leetcode12. Integer to Roman
 * Funtion: Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.
 * Author: LKJ
 * Date:2016/7/27
 * Hint: Related to12. Roman to Integer
*/
#include <iostream>
#include <vector>
#include <string>

using namespace std;

class Solution {
public:
    string intToRoman(int num) {
        char* Roman[4][10] = {
            {"","I","II","III","IV","V","VI","VII","VIII","IX"},
            {"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"},
            {"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},
            {"","M","MM","MMM"}
        };
        string result;
        result.append(Roman[3][num/1000]);
        result.append(Roman[2][num%1000/100]);
        result.append(Roman[1][num%100/10]);
        result.append(Roman[0][num%10]);
        return result;
    }
};


int main(){
    int myin;
    string myout;
    Solution SA;
    cout << "Please Enter" << endl;
    cin >> myin;
    myout = SA.intToRoman(myin);
    cout << myout << endl;

    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值