leetcode_16 Integer to Roman

题目：

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

• I can be placed before V (5) and X (10) to make 4 and 9. 
• X can be placed before L (50) and C (100) to make 40 and 90. 
• C can be placed before D (500) and M (1000) to make 400 and 900.

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: 3
Output: "III"

Example 2:

Input: 4
Output: "IV"

Example 3:

Input: 9
Output: "IX"

Example 4:

Input: 58
Output: "LVIII"
Explanation: L = 50, V = 5, III = 3.

Example 5:

Input: 1994
Output: "MCMXCIV"
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

首先解析以下题目：题目给出了单个罗马字母对应的数字

Symbol       Value             
I             1
V             5                     4 =(5 - 1)表示为15——>IV  
X             10                    9 = (10 - 1) 表示为 1 10 ——> IX 
L             50                    40 = （50 - 10）表示为 10 50 ——> XL
C             100                   90 =  (100 - 10) 表示为 10 100 ——>XC 
D             500                   400 = (500 - 100) 表示为 100 500 ——>CD
M             1000                  900 = (1000 - 100) 表示为 100 1000 ——>CM

有了上面的理解，再用贪婪算法，找出最大的数，得到字符串后，减去最大数；再找最大数，且最大数比当前数小，在数组中位于之前最大数的后面

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