Day 13
题目:罗马数字转整数
leetcode链接:罗马数字转整数
要点:哈希表
今天有点累,做题一直做不出来,脑子不太好使,弄个简单题凑数吧
1、Java
class Solution {
public int romanToInt(String s) {
Map<Character, Integer> hashmap = new HashMap<>();
hashmap.put('I', 1);
hashmap.put('V', 5);
hashmap.put('X', 10);
hashmap.put('L', 50);
hashmap.put('C', 100);
hashmap.put('D', 500);
hashmap.put('M', 1000);
int sum = 0;
for(int i = 0; i < s.length()-1; i++){
int value = hashmap.get(s.charAt(i));
if(value < hashmap.get(s.charAt(i + 1))) sum = sum - value;
else sum = sum + value;
}
sum = sum + hashmap.get(s.charAt(s.length() - 1));
return sum;
}
}
2、python
class Solution:
def romanToInt(self, s: str) -> int:
hashtable = dict()
hashtable['I'] = 1
hashtable['V'] = 5
hashtable['X'] = 10
hashtable['L'] = 50
hashtable['C'] = 100
hashtable['D'] = 500
hashtable['M'] = 1000
i = 0
n = len(s)
sum = 0
while i < n:
if i < n-1 and hashtable[s[i]] < hashtable[s[i+1]]:
sum = sum - hashtable[s[i]]
else:
sum = sum + hashtable[s[i]]
i = i + 1
return sum