LeetCode全集请参考：LeetCode Github 大全

算法

13. Roman to Integer

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, 2 is written as II in Roman numeral, just two one’s added together. 12 is written as XII, which is simply X + II. The number 27 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.

Example 1:

Input: s = "III"
Output: 3

Example 2:

Input: s = "IV"
Output: 4

Example 3:

Input: s = "IX"
Output: 9

Example 4:

Input: s = "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.

Example 5:

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

Constraints:

1 <= s.length <= 15

s contains only the characters ('I', 'V', 'X', 'L', 'C', 'D', 'M').
It is guaranteed that s is a valid roman numeral in the range [1, 3999].

Map记录解法

先用map记录对应的char和数字。
如果前一个字母比后一个字母小，则说明是减法。
最后一个字母累加即可。

class Solution {public int romanToInt(String s) {Map<Character, Integer> map = new HashMap<>();map.put('I', 1);map.put('V', 5);map.put('X', 10);map.put('L', 50);map.put('C', 100);map.put('D', 500);map.put('M', 1000);char[] chars = s.toCharArray();int sum = 0;for(int i = 0; i < chars.length - 1; i++) {if (map.get(chars[i]) < map.get(chars[i + 1])) {sum -= map.get(chars[i]);} else {sum += map.get(chars[i]);}}sum += map.get(chars[chars.length - 1]);return sum;}
}

算法：罗马数字转换为整数13. Roman to Integer相关推荐

LeetCode 13. Roman to Integer
问题链接 LeetCode 13. Roman to Integer 题目解析将罗马数字转换成普通数字. 解题思路先简单了解一下什么是罗马数字. 基本字符:I,V,X,L,C,D,M 相应的阿拉伯 ...
算法罗马数字转整数
算法罗马数字转整数 1.题目 2.方法 2.1枚举法(没得办法) 2.2map(大神级别) 1.题目罗马数字包含以下七种字符: I, V, X, L,C,D 和 M. 字符数值 I 1 V 5 ...
Leetcode典型题解答和分析、归纳和汇总——T12（罗马数字转换为整数）
题目描述: 罗马数字包含以下七种字符:IVXLCDM 问题解析: [1]通过构建hashmap的键值对的查询关系,可以获得罗马数字与整数之间的关系: [2]处理特殊的规则:逐个识别罗马字符串s(从左至 ...
C#LeetCode刷题之#13-罗马数字转整数（Roman to Integer）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3842 访问. 罗马数字包含以下七种字符: I, V, X, L, ...
leetcode python3 简单题13. Roman to Integer
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第十三题 (1)题目英文: Given a roman numeral, conv ...
【LeetCode】13. Roman to Integer
题目: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from ...
13. Roman to Integer
1.问题描述 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Val ...
python实现罗马数字转换为整数
题目描述上一篇文章中,我们介绍了将阿拉伯数字转换为罗马数字的方法,里面详细介绍了罗马数字的书写规则,请参考python实现将整数转换为罗马数字 LeetCode原题地址:https://leetco ...
Java算法罗马数字转整数
本文章只提供算法. 罗马数字包含以下七种字符: I, V, X, L,C,D 和 M. 字符数值 I 1 V 5 X ...
LeetCode: 13. Roman to Integer
051106 题目 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol ...

算法：罗马数字转换为整数13. Roman to Integer

算法

Map记录解法

算法：罗马数字转换为整数13. Roman to Integer相关推荐

最新文章

热门文章