題目描述:(鏈接）

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

解題思路：

1 class Solution { 2 public: 3 string intToRoman(int num) { 4 vector<int> values{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}; 5 vector<string> numbers{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"}; 6 string result; 7 for (int i = 0; i < values.size(); ++i) { 8 while (num >= values[i]) { 9 num -= values[i]; 10 result.append(numbers[i]); 11 } 12 } 13 14 return result; 15 } 16 };

?

轉載于:https://www.cnblogs.com/skycore/p/4959870.html

總結

以上是生活随笔為你收集整理的[LeetCode]Integer to Roman的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。