LeetCode Solutions
class Solution {
public:
string intToRoman(int num) {
const vector<pair<int, string>> valueSymbols{
{1000, "M"}, {900, "CM"}, {500, "D"}, {400, "CD"}, {100, "C"},
{90, "XC"}, {50, "L"}, {40, "XL"}, {10, "X"}, {9, "IX"},
{5, "V"}, {4, "IV"}, {1, "I"}};
string ans;
for (const auto& [value, symbol] : valueSymbols) {
if (num == 0)
break;
while (num >= value) {
num -= value;
ans += symbol;
}
}
return ans;
}
};
|
class Solution {
public String intToRoman(int num) {
final int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
final String[] symbols = {"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) {
if (num == 0)
break;
while (num >= values[i]) {
num -= values[i];
sb.append(symbols[i]);
}
}
return sb.toString();
}
}
|
class Solution:
def intToRoman(self, num: int) -> str:
valueSymbols = [(1000, 'M'), (900, 'CM'),
(500, 'D'), (400, 'CD'),
(100, 'C'), (90, 'XC'),
(50, 'L'), (40, 'XL'),
(10, 'X'), (9, 'IX'),
(5, 'V'), (4, 'IV'),
(1, 'I')]
ans = []
for value, symbol in valueSymbols:
if num == 0:
break
count, num = divmod(num, value)
ans.append(symbol * count)
return ''.join(ans)
|
