Roman to Integer
来源：互联网 发布：达梦数据库公司上市 编辑：程序博客网 时间：2024/06/02 03:56
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
class Solution {public: int charToInt(char c) { switch(c) { case 'I': return 1; case 'V': return 5; case 'X': return 10; case 'L': return 50; case 'C': return 100; case 'D': return 500; case 'M': return 1000; default: return 0; } } int romanToInt(string s) { int result = 0; for (int i = 0; i < s.length(); i++) { result = result + charToInt(s[i]) - 2*(result % charToInt(s[i])); } return result; }}; 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
- C#什么时候该使用静态类呢?
- 面试题—Java递归实现约瑟夫环
- 高盛CEO：从贫穷中崛起，我的5条建议
- python学习笔记之密码高强度加密
- 空class的size问题
- Roman to Integer
- Android fill_parent、wrap_content和match_parent的区别
- C语言中.h和.c文件差别
- PHP魔术方法之 __sleep() 和 __wakeup()
- 世界那么大，能够被记录下来的也就只有文字
- LeetCode 127 Word Ladder
- 猜年龄
- 二叉树创建，遍历，创建遍历指针小套路
- POJ2226 Muddy Fields 二分图求最小覆盖点
