LeetCode - 12. Integer to Roman

2024-09-05 16:58

文章标签 leetcode integer roman

本文主要是介绍LeetCode - 12. Integer to Roman，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

12. Integer to Roman

Problem's Link

----------------------------------------------------------------------------

Mean:

将一个int型的整数转化为罗马数字.

analyse:

没什么好说的，直接维基百科.

Time complexity: O(N)

view code

 /** 
  * ----------------------------------------------------------------- 
  * Copyright (c) 2016 crazyacking.All rights reserved. 
  * ----------------------------------------------------------------- 
  *       Author: crazyacking 
  *       Date  : 2016-02-16-11.55 
  */ 
 #include <queue> 
 #include <cstdio> 
 #include <set> 
 #include <string> 
 #include <stack> 
 #include <cmath> 
 #include <climits> 
 #include <map> 
 #include <cstdlib> 
 #include <iostream> 
 #include <vector> 
 #include <algorithm> 
 #include <cstring> 
 using namespace std; 
 typedef long long( LL); 
 typedef unsigned long long( ULL); 
 const double eps( 1e-8); 
 
 class Solution 
 { 
 public : 
     string intToRoman( int num) 
     { 
         string M [] = { "" , "M" , "MM" , "MMM" }; 
         string C [] = { "" , "C" , "CC" , "CCC" , "CD" , "D" , "DC" , "DCC" , "DCCC" , "CM" }; 
         string X [] = { "" , "X" , "XX" , "XXX" , "XL" , "L" , "LX" , "LXX" , "LXXX" , "XC" }; 
         string I [] = { "" , "I" , "II" , "III" , "IV" , "V" , "VI" , "VII" , "VIII" , "IX" }; 
         return M [ num / 1000 ] + C [( num % 1000) / 100 ] + X [( num % 100) / 10 ] + I [ num % 10 ]; 
     } 
 }; 
 
 int main() 
 { 
     Solution solution; 
     int n; 
     while( cin >>n) 
     { 
         cout << solution . intToRoman(n) << endl; 
     } 
     return 0; 
 } 