> For the complete documentation index, see [llms.txt](https://timmybeeflin.gitbook.io/cracking-leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://timmybeeflin.gitbook.io/cracking-leetcode/array_problem/12.-integer-to-roman.md).

# 12. Integer to Roman

![](/files/-MbLSHy92WdtDW7weg31)

![](/files/-MbLSNNqcTizerE5p6sl)

time: O(n)

space: O(n)

```java
class Solution {
    public String intToRoman(int num) {
        int values[] = new int[] {1000, 900, 500, 400, 100, 
        90, 50, 40, 10, 9, 5, 4, 1};
        String strs[] = new String[] {"M", "CM", "D", "CD", "C", 
        "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
        
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < values.length; i++) {
            while (num >= values[i]) {
                num -= values[i];
                sb.append(strs[i]);
            }
        }
        return sb.toString();
    }
}
```

too easy...