leetcode第九题----- Integer to Roman

题目：Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

解题思路：这里需要借鉴罗马数字的计数法。

1. 相同的数字连写，所表示的数等于这些数字相加得到的数，如 Ⅲ=3；
2. 小的数字在大的数字的右边，所表示的数等于这些数字相加得到的数，如 Ⅷ=8、Ⅻ=12；
3. 小的数字（限于 Ⅰ、X 和 C）在大的数字的左边，所表示的数等于大数减小数得到的数，如 Ⅳ=4、Ⅸ=9；

  我的思路是根据条件判断来增加对应的字符。看代码就懂了。

代码如下：

class Solution {
public:
    string intToRoman(int num) {
        string result;
while(num >= 1000) {
num = num-1000;
result = result+"M";
}
while(num >= 900) {
num = num-900;
result = result+"CM";
}
while(num >= 500) {
num = num-500;
result = result+"D";
}
while(num >= 400) {
num = num-400;
result = result+"CD";
}
while(num >= 100) {
num = num-100;
result = result+"C";
}
while(num >= 90) {
num = num-90;
result = result+"XC";
}
while(num >= 50) {
num = num-50;
result = result+"L";
}
while(num >= 40) {
num = num-40;
result = result+"XL";
}
while(num >= 10) {
num = num-10;
result = result+"X";
}
while(num >= 9) {
num = num-10;
result = result+"IX";
}
while(num >= 5) {
num = num-5;
result = result+"V";
}
while(num >= 4) {
num = num-5;
result = result+"IV";
}
while(num >= 1) {
num = num-1;
result = result+"I";
}
        return result;
    }
};