leetcode013 Roman to Integer
来源:互联网 发布:淘宝怎么刷単 编辑:程序博客网 时间:2024/05/12 08:12
题目
13. Roman to Integer
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
思路:
这道题相比Integer To Roman更简单,直接从罗马数字的最低位开始转换(一个字母一个字母的转换),每次要记录下前一次的数,若此次的数比前一次的小,则在结果减去本次的数,否则加上本次的数。
代码:
private int getNumber(char key){ int res = 0; switch(key) { case 'I': res = 1; break; case 'V': res = 5; break; case 'X': res = 10; break; case 'L': res = 50; break; case 'C': res = 100; break; case 'D': res = 500; break; case 'M': res = 1000; break; } return res;}public int romanToInt(String s){ char[] s_char = s.toCharArray(); int i = s_char.length-1; int lastNum = 0; int res = 0; while(i >= 0) { int tmp = getNumber(s_char[i--]); if(tmp < lastNum) res -= tmp; else res += tmp; lastNum = tmp; } return res;}
结果细节(图):
1 0
- leetcode013 Roman to Integer
- LeetCode013:Roman to Integer
- Leetcode013 Roman to Integer
- 【LeetCode013算法/编程练习C++】Roman to Integer //难得击败了80%的人
- 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
- 如何查看某个端口被谁占用
- html 点击<a>元素后颜色的变换
- Linux下部署weblogic
- 操作系统习题解答 (张尧学) 第一章
- JavaScript 异步编程的四种方法
- leetcode013 Roman to Integer
- C++遗传算法实现
- POJ3267 The Cow Lexicon 题解
- Linux awk工具 简介
- MySQL(MariaDB) 入门
- TCP/IP
- perl 一个简单的面向对象的例子
- test1
- genymotion arm translation 1.1和支持5.0的包