【每日打卡】2020.04.20

notmaster commented 4 years ago

算法-题解

duyue6002 commented 4 years ago

gengmingOrg commented 4 years ago

lyn-ho commented 4 years ago

amandafanny commented 4 years ago

` * @param {number} num

@return {string} */ var intToRoman = function(num) { const [min, max] = [1, 3999] if (num < min || num > max) { return 0; } let str = ''; const Roman = [['', 'M'], ['D', 'C'], ['L', 'X'], ['V', 'I']] const data = num.toString().padStart(4, '0').split('') for (let i = 0; i < data.length; i ++) { switch (data[i]) { case '0': break; case '4': str += ${Roman[i][1]}${Roman[i][0]};break; case '9': str += ${Roman[i][1]}${Roman[i - 1][1]};break; default: { const hasFive = data[i] - 5 >= 0; const repeatNum = hasFive ? data[i] - 5 : data[i]; str += ${hasFive ? Roman[i][0] : ''}${Roman[i][1].repeat(repeatNum)} } } } return str; };`

JTDI / leetcode-practice