0013_Roman to Integer
来源:互联网 发布:mysql u p h端口 编辑:程序博客网 时间:2024/05/23 17:14
Java
设置一个hashmap,字符为键值,数字为值,从左向右读取字符串中的字符,若后一位的取值比前一位的大,说明需要做减法,否则做加法。O(N)的时间复杂度,但是排名在后1/4。。。
public class Solution { public int romanToInt(String s) { HashMap<Character,Integer> map = new HashMap<Character,Integer>(); 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); int result = 0; for(int i = 0; i < s.length();){ if(i+1 < s.length() && map.get(s.charAt(i)) < map.get(s.charAt(i+1))){ result = result + map.get(s.charAt(i+1)) - map.get(s.charAt(i)); i += 2; }else{ result = result + map.get(s.charAt(i)); ++i; } } return result; }}
阅读全文
0 0
- 0013_Roman to Integer
- LeetCode 13_Roman to Integer
- leetcode第一刷_Roman to Integer
- 【Integer转换】Integer to Roman
- string to integer & integer to string
- Integer to Roman & Roman to Integer
- Integer to Roman & Roman to Integer
- LeetCode Roman to Integer && Integer to Roman
- 【leetcode】Roman to Integer | Integer to Roman
- Leetcode - "Roman to Integer" & "Integer to Roman"
- LeetCode:Roman to Integer,Integer to Roman
- Integer to Roman and Roman to Integer
- LeetCode Integer to Roman & Roman to Integer
- Roman to Integer/Integer to Roman
- leetcode - roman to integer & integer to roman
- "Roman to Integer" and "Integer to Roman"
- Roman to Integer &&Integer to Roman
- Roman to Integer and Integer to Roman
- HDU 2549 壮志难酬
- 微软大楼设计方案(简单)
- vue单一组件下动态修改数据时的全部重渲染
- Tomcat+Nginx集群与负载均衡
- 堆和栈的区别
- 0013_Roman to Integer
- Scala方法和函数
- 主动与被动、绽放与掩饰
- 【C#】初识
- 简单介绍 Kotlin for Android
- bootstrap01
- TensorFlow实战——CNN(LeNet5)——MNIST数字识别
- Pycharm2017激活码
- CSU 2131:突然的灵光 (三分法)