LeetCode/12.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
public:
    string convertToRoman(int num, int pos)
    {
        if(!num)
            return "";

        string c1, c2, c3;

        switch(pos)
        {
            case 1: c1 = 'I';
                    c2 = 'V';
                    c3 = 'X';
                    break;
            case 2: c1 = 'X';
                    c2 = 'L';
                    c3 = 'C';
                    break;
            case 3: c1 = 'C';
                    c2 = 'D';
                    c3 = 'M';
                    break;
            case 4: c1 = 'M';
                    break;
        }

        switch(num)
        {
            case 1: return c1;
            case 2: return c1 + c1;
            case 3: return c1 + c1 + c1;
            case 4: return c1 + c2;
            case 5: return c2;
            case 6: return c2 + c1;
            case 7: return c2 + c1 + c1;
            case 8: return c2 + c1 + c1 + c1;
            case 9: return c1 + c3;
        }


    }

    string intToRoman(int num) {
        return convertToRoman(num/1000, 4) + convertToRoman((num/100)%10, 3) + convertToRoman((num/10)%10, 2) + convertToRoman(num%10, 1);
    }
};