题解 | #牛牛的罗马时代节日#
牛牛的罗马时代节日
https://www.nowcoder.com/practice/97447e046b704ffda3f51281bd7e296b
class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param cowsRomanNumeral string字符串vector * @return int整型 */ int romanToInt(string s) { unordered_map<char, int> roman_map = { {'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000} }; int result = 0; int prev_value = 0; for (int i = s.length() - 1; i >= 0; i--) { int current_value = roman_map[s[i]]; if (current_value < prev_value) { result -= current_value; } else { result += current_value; } prev_value = current_value; } return result; } int sumOfRomanNumerals(vector<string>& cowsRomanNumeral) { // write code here int ans = 0; for (int i = 0; i < cowsRomanNumeral.size(); i++) { ans += romanToInt(cowsRomanNumeral[i]); } return ans; } };