본문 바로가기
LeetCode/Top Interview Q. - Easy

LeetCode.Roman to Integer [Math]

by 벤진[Benzene] 2020. 6. 16.

Problem:

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, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven 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. Input is guaranteed to be within the range from 1 to 3999.

 

Example 1:

Input: "III"

Output: 3

 

Example 2:

Input: "IV"

Output: 4

 

Example 3:

Input: "IX"

Output: 9

 

Example 4:

Input: "LVIII"

Output: 58

Explanation: L = 50, V= 5, III = 3.

 

Example 5:

Input: "MCMXCIV"

Output: 1994

Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

 

-Summary-

1. Reverse the string and compare it with the previous numeric value.

- If current character value is greater or equal to the previous value, then we add to the answer

- If not, then we subtract the current value instead. (Ex) IV --> 5-1 = 4, IX --> 10-1 = 9

 

모든 문제에 대한 저작권은 LeetCode 회사에 있습니다. [Copyright © 2020 LeetCode]

'LeetCode > Top Interview Q. - Easy' 카테고리의 다른 글

LeetCode.Hamming Distance [Bit]  (0) 2020.06.18
LeetCode.Number of 1 Bits [Bit]  (0) 2020.06.17
LeetCode. Count Primes [Math]  (0) 2020.06.15
LeetCode. Count Primes [Math]  (0) 2020.06.14
LeetCode. Fizz Buzz [Math]  (0) 2020.06.13

댓글