leetcode刷题_OJ 12&13

OJ12

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: C = 100, L = 50, XXX = 30 and III = 3.

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

题目的主要意思：输入数字，输出其对应罗马数字

这题可以理解为简单罗马数字和复合罗马数字的组合，但是由于数据范围回到3999，所以可以简单粗暴地通过数组预定义各个位置上的数字的对应表示，然后依次获得输入数字的各位去数组搜索即可。

class Solution {
public:
    string intToRoman(int num) {
        string result;
        string Thou[]={"","M","MM","MMM"};
        string Hund[]={"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"};
        string Ten[]={"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
        string One[]={"","I","II","III","IV","V","VI","VII","VIII","IX"};

        result+=Thou[(int)(num/1000)%10];
        result+=Hund[(int)(num/100)%10];
        result+=Ten[(int)(num/10)%10];
        result+=One[(int)num%10];
        return result;
    }
};

 

OJ13

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 a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: "III"
Output: 3
Example 2:

Input: "IV"
Output: 4
Example 3:

Input: "IX"
Output: 9
Example 4:

Input: "LVIII"
Output: 58
Explanation: C = 100, L = 50, XXX = 30 and III = 3.
Example 5:

Input: "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
题目的意思：跟上面一样的类型，只是这时候不能再通过计算下标来从数组中取数，可是我们换个思考的方法：3个'I'代表3，也就是3个‘1’相加，那么我们只要在读到'I'选择加1即可。如果是‘4’、‘9’之类的数字，比较显著的特点是前一个字符代表的数字比后一个小，所以我们只要在遍历字符串时添加一个if判断，碰到此类情况，就减去前一个字符代表的数字即可，具体事项如下：

class Solution {
public:
    int romanToInt(string s) {
    	int result=0;
        int len=s.size();
        for(int i=0;i<len-1;i++){
        	if(romanCharToInt(s[i])<romanCharToInt(s[i+1])){
        		result-=romanCharToInt(s[i]);
        	}
        	else{
        		result+=romanCharToInt(s[i]);
        	}
        }
        return result+romanCharToInt(s[len-1]);
    }

    int romanCharToInt(char c){
    	switch(c){
    		case 'I':
    			return 1;
    		case 'V':
    			return 5;
    		case 'X':
    			return 10;
    		case 'L':
    			return 50;
    		case 'C':
    			return 100;
    		case 'D':
    			return 500;
    		case 'M':
    			return 1000;
    		default:
    			return 0;
    	}
    }

};