13-Integer to Roman-字符串相关-HashMap

【题目】

Given an integer, convert it to a roman numeral.

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

【解析】

和上一题对偶，同样考查HashMap的使用

我的思路是先给HashMap赋值，然后获取int字符类型每一位的值，换算成可以查找HashMap对应值的类型后相加即可。

【代码】

public class Solution {
    public String intToRoman(int num) {
        Map<Integer,String> map = new HashMap<Integer,String>();
  String[] roman = {"","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"};
  int[] intnum={0,1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100,200,300,
  400,500,600,700,800,900,1000,2000,3000};
  for(int i=0;i<31;i++){
  map.put(intnum[i], roman[i]);
  }


  int g,s,b,q;
  g=num%10;
  s=num/10%10*10;
  b=num/100%10*100;
  q=num/1000%10*1000;
  
  String result=map.get(q)+map.get(b)+map.get(s)+map.get(g);
       return result;
    }
}