divmod and match-case clear solution for Roman Numerals by lxf42 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

divmod and match-case solution in Clear category for Roman Numerals by lxf42

def checkio(data):
    ROMANS = {1:'I', 5:'V', 10:'X', 50:'L', 100:'C', 500:'D', 1000:'M'}
    pos = 1
    roman = ''
    while data > 0:
        data, val = divmod(data, 10)
        match val:
            case 1 | 2 | 3:
                roman = val * ROMANS[pos] + roman
            case 4:
                roman = ROMANS[pos] + ROMANS[pos * 5] + roman
            case 5:
                roman = ROMANS[pos * 5] + roman
            case 6 | 7 | 8:
                roman = ROMANS[pos * 5] + (val - 5) * ROMANS[pos] + roman
            case 9:
                roman = ROMANS[pos] + ROMANS[pos * 10] + roman
        pos *= 10
    return roman

March 22, 2022

Comments:

hbczmxy on July 25, 2022, 2:45 a.m.
Although I had some trouble reading your code, I learned something new about python from your code - that is, about how to use `match-case`. Also I have a small suggestion that you better add proper explanation comments to your code so that your code will be easier to understand!

GitHub

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.