LeetCode-12-Integer to Roman(哈希)-Medium

原创于 2015-12-24 08:20:51 发布 · 431 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

68 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，通过分解整数的千位、百位、十位和个位，并利用查表法进行转换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意理解：

将整数转换为罗马数字

题目分析：

1. 分解出千位、百位、十位和个位；

2. 对应查表；

解题代码：

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