Roman to Integer
来源:互联网 发布:tensorflow 入门 编辑:程序博客网 时间:2024/06/08 12:07
public class Solution { public int romanToInt(String s) { int answer = 0; int i = 0; int len = s.length(); while(i < len) { int x=0; //要注意的是这题总是优先判断两个字母组合的情况,x就是起这个作用的 if(i < len -1) { if(s.charAt(i) == 'C' && s.charAt(i+1) == 'M') { answer = answer + 900; i = i + 2; x++; } else if(s.charAt(i) == 'C' && s.charAt(i+1) == 'D') { answer = answer + 400; i = i + 2; x++; } else if(s.charAt(i) == 'X' && s.charAt(i+1) == 'C') { answer = answer + 90; i = i + 2; x++; } else if(s.charAt(i) == 'X' && s.charAt(i+1) == 'L') { answer = answer + 40; i = i + 2; x++; } else if(s.charAt(i) == 'I' && s.charAt(i+1) == 'X') { answer = answer + 9; i = i + 2; x++; } else if(s.charAt(i) == 'I' && s.charAt(i+1) == 'V') { answer = answer + 4; i = i + 2; x++; } } if (i<len && x == 0) { if(s.charAt(i) == 'M') { answer = answer + 1000; i++; } else if(s.charAt(i) == 'D') { answer = answer + 500; i++; } else if(s.charAt(i) == 'C') { answer = answer + 100; i++; } else if(s.charAt(i) == 'L') { answer = answer + 50; i++; } else if(s.charAt(i) == 'X') { answer = answer + 10; i++; } else if(s.charAt(i) == 'V') { answer = answer + 5; i++; } else if(s.charAt(i) == 'I') { answer = answer + 1; i++; } } } return answer; }}
0 0
- 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
- Roman to Integer/Integer to Roman
- LeetCode:Roman to Integer
- LeetCode: Integer to Roman
- LeetCode: Roman to Integer
- LeetCode Integer to Roman
- 概念学习和一般到特殊序
- 生命游戏HTML5 Canvas代码
- JAVA面向程序第二版课后习题4.1
- css
- struts2.3.20的action中的validate验证
- Roman to Integer
- 一个简单有效的产生随机数且不重复的小算法--Robert Floyd
- Word Search - Leetcode
- 求数组中的最大连续和
- 《人人都是产品经理》读后感三——一个需求的奋斗史
- C#设计模式(九)外观模式
- apache配置网站目录的读写权限
- gen_server的同步调用内部实现机制及From的前世今生
- linux CentOs 权限导致的Apache - "DocumentRoot must be a directory"的解决方案