阿拉伯数字与罗马数字相互转换

2017-05-22  本文已影响0人  静候那一米阳光

LeetCode题目:
Integer to Roman
Roman to Integer

罗马数字规则

罗马数字共有7个,即I(1),V(5),X(10),L(50),C(100),D(500),M(1000)。按照下面的规则可以表示任意正整数。

JavaScript转换算法(适用于1-3999的整数)

//阿拉伯数字转罗马数字
var intToRoman = function(num) {
    var Roman = ["I", "V", "X", "L", "C", "D", "M"]; //1,5,10,50,100,500,1000
    var k = 0,
        res = "";
    while (num > 0) {
        var n = num % 10;
        var cur = "";
        if (n <= 3) {
            while (n--) {
                cur += Roman[2 * k];
            }
        } else if (n == 4) {
            cur += Roman[2 * k] + Roman[2 * k + 1];
        } else if (n <= 8) {
            cur += Roman[2 * k + 1];
            while (--n >= 5) {
                cur += Roman[2 * k];
            }
        } else if (n == 9) {
            cur += Roman[2 * k] + Roman[2 * (k + 1)];
        }
        res = cur + res;
        num = parseInt(num / 10);
        k++;
    }
    return res;
};
//罗马数字转阿拉伯数字
var romanToInt = function(s) {
    var Roman = ["I", "V", "X", "L", "C", "D", "M"];
    var Int = [1, 5, 10, 50, 100, 500, 1000];
    var res = 0;
    for (var i = 0; i < s.length; i++) {
        var cur = Roman.indexOf(s[i]);
        if (cur % 2 == 0) {
            var next = Roman.indexOf(s[i + 1]);
            if (next - cur == 1 || next - cur == 2) {
                res += Int[next] - Int[cur];
                i++;
            } else {
                res += Int[cur];
            }
        } else {
            res += Int[cur];
        }
    }
    return res;
};
for (var i = 1; i <= 3999; i++) {
    var roman = intToRoman(i)
    var int = romanToInt(roman)
    console.log(i, roman, int)
}

2018.2.6重做补充

//阿拉伯转罗马数字
function convertToRoman(num) {
  /*
  1 I
  5 V
  10 X
  50 L
  100 C
  500 D
  1000 M
  */
  var arr = [
    ["I", "V"],
    ["X", "L"],
    ["C", "D"],
    ["M"]
  ];
  var res = [];
  var count = 0;
  while (num > 0) {
    var p = num % 10;
    switch (p) {
      case 0:
        break;
      case 1:
      case 2:
      case 3:
        res.unshift(arr[count][0].repeat(p));
        break;
      case 4:
        res.unshift(arr[count][0] + arr[count][1]);
        break;
      case 5:
        res.unshift(arr[count][1]);
        break;
      case 6:
      case 7:
      case 8:
        res.unshift(arr[count][1] + arr[count][0].repeat(p - 5));
        break;
      case 9:
        res.unshift(arr[count][0] + arr[count + 1][0]);
        break;
      default:
        break;
    }
    num = Math.floor(num / 10);
    count++;
  }
  return res.join("");
}

console.log(convertToRoman(3999));

上一篇 下一篇

猜你喜欢

热点阅读