LeetCode12. Integer to Roman

xiaoxiao2021-02-28  70

题目

Given an integer, convert it to a roman numeral.

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

思路

先百度一下,查看罗马数字(String表示)与int类型之间的转换

这样代码就很好编写了,我们只要按照int类型的每一位的数字,将其查表转换成String类型,在串联起来即可,具体代码如下:

代码

public class Solution { public String intToRoman(int num) { String []n1 = {"","I","II","III","IV","V","VI","VII","VIII","IX"}; String []n10 = {"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"}; String []n100 = {"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"}; String []n1000 = {"","M","MM","MMM"}; String s = n1000[num / 1000] + n100[(num / 100 ) % 10] + n10[(num / 10) % 10] + n1[num % 10]; return s; } }

转载请注明原文地址: https://www.6miu.com/read-52787.html

最新回复(0)