Created
October 18, 2018 05:19
-
-
Save didxga/fd087d8edecaef8603c54c53531c02ac to your computer and use it in GitHub Desktop.
JS Bin // source https://jsbin.com/raducaz
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="utf-8"> | |
<meta name="viewport" content="width=device-width"> | |
<title>JS Bin</title> | |
</head> | |
<body> | |
<script id="jsbin-javascript"> | |
var m = ["I", "X", "C", "M"]; | |
var n = ["V", "L", "D"]; | |
function convert(n) { | |
var roman_n = ""; | |
(n+"").split("").reverse().forEach(function(e, i){ | |
var roman = ""; | |
switch(e) { | |
case "1": | |
case "2": | |
case "3": | |
roman = m[i].repeat(e);break; | |
case "4": | |
roman = m[i] + n[i];break; | |
case "5": | |
roman = n[i];break; | |
case "6": | |
case "7": | |
case "8": | |
roman = n[i] + m[i].repeat(e);break; | |
case "9": | |
roman = m[i] + m[i+1]; | |
} | |
roman_n = roman + roman_n; | |
}); | |
return roman_n; | |
} | |
console.log(convert(10)); | |
</script> | |
<script id="jsbin-source-javascript" type="text/javascript">var m = ["I", "X", "C", "M"]; | |
var n = ["V", "L", "D"]; | |
function convert(n) { | |
var roman_n = ""; | |
(n+"").split("").reverse().forEach(function(e, i){ | |
var roman = ""; | |
switch(e) { | |
case "1": | |
case "2": | |
case "3": | |
roman = m[i].repeat(e);break; | |
case "4": | |
roman = m[i] + n[i];break; | |
case "5": | |
roman = n[i];break; | |
case "6": | |
case "7": | |
case "8": | |
roman = n[i] + m[i].repeat(e);break; | |
case "9": | |
roman = m[i] + m[i+1]; | |
} | |
roman_n = roman + roman_n; | |
}); | |
return roman_n; | |
} | |
console.log(convert(10));</script></body> | |
</html> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var m = ["I", "X", "C", "M"]; | |
var n = ["V", "L", "D"]; | |
function convert(n) { | |
var roman_n = ""; | |
(n+"").split("").reverse().forEach(function(e, i){ | |
var roman = ""; | |
switch(e) { | |
case "1": | |
case "2": | |
case "3": | |
roman = m[i].repeat(e);break; | |
case "4": | |
roman = m[i] + n[i];break; | |
case "5": | |
roman = n[i];break; | |
case "6": | |
case "7": | |
case "8": | |
roman = n[i] + m[i].repeat(e);break; | |
case "9": | |
roman = m[i] + m[i+1]; | |
} | |
roman_n = roman + roman_n; | |
}); | |
return roman_n; | |
} | |
console.log(convert(10)); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment