Leetcode 刷题——String 12

12. Integer to Roman

https://leetcode.com/problems/integer-to-roman/

用了简单粗暴的方式强行判断，，，

class Solution {
    public String intToRoman(int num) {
        int num1 = num/1000;
        num %= 1000;
        int num2 = num/100;
        num %= 100;
        int num3 = num/10;
        num %= 10;
        int num4 = num;
        
        StringBuilder result = new StringBuilder("");

        solve(result, "M", "", "", num1);
        solve(result, "C", "D", "M", num2);
        solve(result, "X", "L", "C", num3);
        solve(result, "I", "V", "X", num4);
        return result.toString();
    }
    
    
    public void solve(StringBuilder result, String x1, String x2, String x3, int num){
        if(num == 0){
            return;
        }
        String[] appe = new String[9];
        appe[0] = x1;
        appe[1] = x1+x1;
        appe[2] = x1+x1+x1;
        appe[3] = x1+x2;
        appe[4] = x2;
        appe[5] = x2+x1;
        appe[6] = x2+x1+x1;
        appe[7] = x2+x1+x1+x1;
        appe[8] = x1+x3;           
        
        result.append(appe[num-1]);
       
    }
}