leetcode. 12 --- integer to Roman numeral

Integer to Roman number

Answer key : simulation
Use the maximum number each time
An array is stored value, An array storage unit

The code is as follows ：

class Solution {
    
public:
    string intToRoman(int num) {
    
        // value 
        int value[] = 
        {
    
            1000,
            900,500,400,100,
            90,50,40,10,
            9,5,4,1
        };
        // Company 
        string company[] = 
        {
    
            "M",
            "CM","D","CD","C",
            "XC","L","XL","X",
            "IX","V","IV","I"
        };
        string res;
        for(int i = 0;i < 13;i++)
        {
    
            while(num >= value[i]){
    
                num -= value[i];
                res +=  company[i];
            }
        }
        return res;
    }
};

Time complexity :O(1)
Spatial complexity :O(1)