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
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

class Solution {
public:
    string intToRoman(int num) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        char schar[10];
        int index = 0;
        int count;
        if(num / 1000 != 0) {
            count = num / 1000;
            num = num % 1000;
            for(int i = 0; i < count; i++) {
                schar[index++] = 'M';
            }
        }
        if(num / 100 != 0) {
            count = num / 100;
            num = num % 100;
            switch(count) {
                case 1:
                    schar[index++] = 'C';
                    break;
                case 2:
                    schar[index++] = 'C';
                    schar[index++] = 'C';
                    break;
                case 3:
                    schar[index++] = 'C';
                    schar[index++] = 'C';
                    schar[index++] = 'C';
                    break;
                case 4:
                    schar[index++] = 'C';
                    schar[index++] = 'D';
                    break;
                case 5:
                    schar[index++] = 'D';
                    break;
                case 6:
                    schar[index++] = 'D';
                    schar[index++] = 'C';
                    break;
                case 7:
                    schar[index++] = 'D';
                    schar[index++] = 'C';
                    schar[index++] = 'C';
                    break;
                case 8:
                    schar[index++] = 'D';
                    schar[index++] = 'C';
                    schar[index++] = 'C';
                    schar[index++] = 'C';
                    break;
                case 9:
                    schar[index++] = 'C';
                    schar[index++] = 'M';
                    break;
            }
        }
        if(num / 10 != 0) {
            count = num / 10;
            num = num % 10;
            switch(count) {
                case 1:
                    schar[index++] = 'X';
                    break;
                case 2:
                    schar[index++] = 'X';
                    schar[index++] = 'X';
                    break;
                case 3:
                    schar[index++] = 'X';
                    schar[index++] = 'X';
                    schar[index++] = 'X';
                    break;
                case 4:
                    schar[index++] = 'X';
                    schar[index++] = 'L';
                    break;
                case 5:
                    schar[index++] = 'L';
                    break;
                case 6:
                    schar[index++] = 'L';
                    schar[index++] = 'X';
                    break;
                case 7:
                    schar[index++] = 'L';
                    schar[index++] = 'X';
                    schar[index++] = 'X';
                    break;
                case 8:
                    schar[index++] = 'L';
                    schar[index++] = 'X';
                    schar[index++] = 'X';
                    schar[index++] = 'X';
                    break;
                case 9:
                    schar[index++] = 'X';
                    schar[index++] = 'C';
                    break;
            }
        }
        if(num != 0) {
            count = num;
            switch(count) {
                case 1:
                    schar[index++] = 'I';
                    break;
                case 2:
                    schar[index++] = 'I';
                    schar[index++] = 'I';
                    break;
                case 3:
                    schar[index++] = 'I';
                    schar[index++] = 'I';
                    schar[index++] = 'I';
                    break;
                case 4:
                    schar[index++] = 'I';
                    schar[index++] = 'V';
                    break;
                case 5:
                    schar[index++] = 'V';
                    break;
                case 6:
                    schar[index++] = 'V';
                    schar[index++] = 'I';
                    break;
                case 7:
                    schar[index++] = 'V';
                    schar[index++] = 'I';
                    schar[index++] = 'I';
                    break;
                case 8:
                    schar[index++] = 'V';
                    schar[index++] = 'I';
                    schar[index++] = 'I';
                    schar[index++] = 'I';
                    break;
                case 9:
                    schar[index++] = 'I';
                    schar[index++] = 'X';
                    break;
                default:
                    break;
            }
        }
        schar[index] = '\0';
        string s = schar;
        return s;
    }
};