leetcode 12. Integer to Roman

最新推荐文章于 2022-10-20 18:00:00 发布

含笑饮毒酒_

最新推荐文章于 2022-10-20 18:00:00 发布

阅读量284

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： C语言 leetcode 编程笔试

本文链接：https://blog.youkuaiyun.com/u010453704/article/details/51456489

leetcode 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，输入范围限制在1到3999之间。通过定义一个四维字符数组来对应千、百、十、个位上的罗马数字表示，实现了简单的字符串拼接，最终返回转换后的罗马数字字符串。

Given an integer, convert it to a roman numeral.

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

从千位到各位，把每一位数对应的罗马数字字符串连接即可。

char* intToRoman(int num) {
    char *base[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","","","","","",""
                };
    char *res;
    res=(char *)malloc(20*sizeof(char));
    res[0]='\0';
    int x=num/1000;
    strcat(res,base[3][x]);
    x=(num/100)%10;
    strcat(res,base[2][x]);
    x=(num/10)%10;
    strcat(res,base[1][x]);
    x=num%10;
    strcat(res,base[0][x]);
    return res;
}