one if (i < n - 1 && value < romanMap[s[i + 1]]) { result -= value; // Subtract the value } else { result += value; // Add the value } } return result; // Return the final result } } // Testing the solution const solution = new Solution(); console.log(solution.romanToInt("XLII")); // 42 console.log(solution.romanToInt("CXCIV")); // 194 console.log(solution.romanToInt("MMMCDXLIV")); // 3444 3f:T4b2,#include #include #include using namespace std; class Solution { public: int romanToInt(string s) { // Map of Roman numerals to integers unordered_map romanMap = {{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}}; int result = 0; // To store the final result int n = s.length(); // Iterate through the string for (int i = 0; i < n; i++) { // Get the value of the current Roman numeral int value = romanMap[s[i]]; // Check if the current numeral is smaller than the next one if (i < n - 1 && value < romanMap[s[i + 1]]) { result -= value; // Subtract the value } else { result += value; // Add the value } } return result; // Return the final result } }; int main() { Solution solution; cout << solution.romanToInt("XLII") << endl; // 42 cout << solution.romanToInt("CXCIV") << endl; // 194 cout << solution.romanToInt("MMMCDXLIV") << endl; // 3444 return 0; } 40:T4fc,using System; using System.Collections.Generic; public class Solution { public int romanToInt(string s) { // Map of Roman numerals to integers Dictionary romanMap = new Dictionary { {'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}