@@ -0,0 +1,1150 @@
+package leetcode.integer_to_roman;%0A%0Aimport java.util.HashMap;%0Aimport java.util.Map;%0A%0Apublic class Solution %7B%0A    public String intToRoman(int num) %7B%0A    %09Map%3CInteger, String%3E map = new HashMap%3CInteger, String%3E();%0A    %09StringBuilder sb = new StringBuilder();%0A    %09String%5B%5D romans = new String%5B%5D%7B%0A    %09%09%22%22, %22I%22, %22II%22, %22III%22, %22IV%22, %22V%22, %22VI%22, %22VII%22, %22VIII%22, %22IX%22,%0A    %09%09%22X%22, %22XX%22, %22XXX%22, %22XL%22, %22L%22, %22LX%22, %22LXX%22, %22LXXX%22, %22XC%22,%0A    %09%09%22C%22, %22CC%22, %22CCC%22, %22CD%22, %22D%22, %22DC%22, %22DCC%22, %22DCCC%22, %22CM%22,%0A    %09%09%22M%22, %22MM%22, %22MMM%22,%0A    %09%7D;%0A    %09for(int i = 0; i %3C= 9; i++)%7B%0A    %09%09map.put(i, romans%5Bi%5D);%0A    %09%7D%0A    %09for(int i = 10; i %3C= 90; i += 10)%7B%0A    %09%09map.put(i, romans%5Bi / 10 + 9%5D);%0A    %09%7D%0A    %09for(int i = 100; i %3C= 900; i += 100)%7B%0A    %09%09map.put(i, romans%5Bi / 100 + 18%5D);%0A    %09%7D%0A    %09for(int i = 1000; i %3C= 3000; i += 1000)%7B%0A    %09%09map.put(i, romans%5Bi / 1000 + 27%5D);%0A    %09%7D%0A    %09for(int x = 1000; x %3E= 1; x /= 10)%7B%0A    %09%09sb.append(map.get((num / x %25 10) * x));%0A    %09%7D%0A    %09return sb.toString();%0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A    %09for(int i = 1; i %3C= 3999; i++)%7B%0A    %09%09System.err.println(i + %22:%22 + new Solution().intToRoman(i));%0A    %09%7D%0A    %7D%0A%7D%0A

Add java solution for 12. Integer to Roman