LeetCode 12 -Integer to Roman ( JAVA )

最新推荐文章于 2025-01-21 17:32:25 发布

原创最新推荐文章于 2025-01-21 17:32:25 发布 · 1.1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

本文介绍了一种将整数转换为罗马数字的算法实现，输入范围为1到3999。通过定义数值和符号的对应数组，采用减法原理逐位匹配，最终输出对应的罗马数字。

Given an integer, convert it to a roman numeral.

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

public class Solution {
    public String intToRoman(int num) {
        String str = new String();    
        String []symbol={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};    
        int []value=    {1000,900,500,400, 100, 90,  50, 40,  10, 9,   5,  4,   1};   
        for(int i=0;num!=0;++i)  
        {  
            while(num>=value[i])  
            {  
                num -= value[i];  
                str += symbol[i];  
            }  
        }  
        return str; 
    }
}