Roman Numerals: Step 16

We’re continuing to refactor the code to pass all cases up to 20.

Here’s the latest refactoring:

static const std::string ToRoman(int n)
{
    struct numeralData
    {
        int n;
        const char* s;
    } nd[] =
    {
        {10,  "X" },
        { 9, "IX" },
        { 5,  "V" },
        { 4, "IV" },
        { 1,  "I" },
    };

    std::string s;
    for (const auto& e : nd) {
        while (n >= e.n) {
            n -= e.n;
            s += e.s;
        }
    }
    return s;
}

I’m liking this. Adding the final few elements to the data array will finish off the kata.

Uncomment all the tests and let ‘er rip.

Once you’re done, click Next.