zoukankan      html  css  js  c++  java
  • 13. Roman to Integer(js)

    13. Roman to Integer

    Roman numerals are represented by seven different symbols: IVXLCDand 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 a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

    Example 1:

    Input: "III"
    Output: 3

    Example 2:

    Input: "IV"
    Output: 4

    Example 3:

    Input: "IX"
    Output: 9

    Example 4:

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

    Example 5:

    Input: "MCMXCIV"
    Output: 1994
    Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
    题意:将罗马数字转化成阿拉伯数字
    代码如下(js):
    var romanToInt = function(s) {
         var num=[];
        var len=s.length;
        var sum=0;
        //将字符全部转换
        for(var i=0;i<len;i++){
            switch(s.charAt(i)){
                case "M":
                    num[i]=1000;
                    break;
                case "D":
                    num[i]=500;
                break;
                case "C":
                    num[i]=100;
                break;
                case "L":
                    num[i]=50;
                break;
                case "X":
                    num[i]=10;
                break;
                case "V":
                    num[i]=5;
                break;
                case "I":
                    num[i]=1;
                break;
            }
        }
        // console.log(num)
        //相加
        for(var i=0;i<len;i++){
            if(num[i]<num[i+1]){
                sum-=num[i];
            }else{
                sum+=num[i];
            }
            // console.log(1,sum)
        }
        return sum
    };
  • 相关阅读:
    [算法][递归]求阶乘
    [数据结构]ArrayStack
    [数据结构]Graph
    [数据结构]TrieTree
    [数据结构]UnionFindSet
    [算法]在数组中找到一个局部最小位置
    在二叉树中找到一个节点的后继节点
    [算法]折纸问题
    常用下载方式的区别-BT下载、磁力链接、电驴
    纯文本-FileOutputStream的解码方式
  • 原文地址:https://www.cnblogs.com/xingguozhiming/p/10380809.html
Copyright © 2011-2022 走看看