forked from leetcoders/LeetCode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathIntegertoRoman.java
29 lines (27 loc) · 886 Bytes
/
IntegertoRoman.java
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
/*
Author: King, wangjingui@outlook.com
Date: Dec 13, 2014
Problem: Integer to Roman
Difficulty: Easy
Source: https://oj.leetcode.com/problems/integer-to-roman/
Notes:
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
Solution: Buffer the roman numbers.
*/
public class Solution {
public String intToRoman(int num) {
int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };
String[] numerals = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" };
StringBuilder result = new StringBuilder();
for(int i=0; i<values.length;i++)
{
while(num>=values[i])
{
num-=values[i];
result.append(numerals[i]);
}
}
return result.toString();
}
}