zoukankan      html  css  js  c++  java
  • LeetCode——012 Integer to Roman

    Description

    Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

    Symbol       Value
    I             1
    V             5
    X             10
    L             50
    C             100
    D             500
    M             1000
    

    For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

    Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

    • I can be placed before V (5) and X (10) to make 4 and 9.
    • X can be placed before L (50) and C (100) to make 40 and 90.
    • C can be placed before D (500) and M (1000) to make 400 and 900.

    Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

    Example 1:

    Input: 3
    Output: "III"
    

    Example 2:

    Input: 4
    Output: "IV"
    

    Example 3:

    Input: 9
    Output: "IX"
    

    Example 4:

    Input: 58
    Output: "LVIII"
    Explanation: L = 50, V = 5, III = 3.
    

    Example 5:

    Input: 1994
    Output: "MCMXCIV"
    Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
    

    Solution

    将罗马数字表示中的复杂部分列举出来即可。

    class Solution {
    public:
    	string intToRoman(int num) {
    		vector<int>values = { 1000,900,500,400,100,90,50,40,10,9,5,4,1 };
    		vector<string>reps = { "M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I" };
    		string res = "";
    		for (int i = 0; i < values.size(); ++i) {
    			while (num >= values[i]) {
    				num -= values[i];
    				res += reps[i];
    			}
    		}
    		return res;
    	}
    };
    
  • 相关阅读:
    简单的C语言编译器--语法分析器
    简单的C语言编译器--词法分析器
    简单的C语言编译器--概述
    最短路径算法
    拓扑排序和关键路径
    图的连通性
    最小生成树
    图的搜索
    gcc O2优化选项对内嵌汇编以及函数递归调用的影响
    gcc 在c代码中内嵌汇编调用c函数: 只是证明曾经我来过
  • 原文地址:https://www.cnblogs.com/zzw1024/p/12334090.html
Copyright © 2011-2022 走看看