首页 > 其他 > 详细

[LeetCode]Integer to Roman

时间:2015-11-12 19:46:59      阅读:279      评论:0      收藏:0      [点我收藏+]

题目描述:(链接

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 };

 

[LeetCode]Integer to Roman

原文:http://www.cnblogs.com/skycore/p/4959870.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!