Leetcode - Integer to Roman (Python)

Показать описание

March 2021 Leetcode Challenge
Leetcode - Integer to Roman #12
Difficulty: Medium

Timothy H Chang

Рекомендации по теме

Комментарии

hahaha loved the last quote "do not trust me, i know nothing" 😂 after solving the problem

israellopez

I think all solutions to this are O(1) since the set of all roman numerals is constant - fixed rather. That's the argument I was seeing on discussion boards.

class Solution(object):
def intToRoman(self, num):
"""
:type num: int
:rtype: str
"""
numbers = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000]
letters = ['I', 'IV', 'V', 'IX', 'X', 'XL', 'L', 'XC', 'C', 'CD', 'D', 'CM', 'M']

output = ""
start = len(numbers)-1
while num > 0:
while num // numbers[start] >= 1:
output += letters[start]
num -= numbers[start]
start -= 1
return output

janmichaelaustria

I did somewhat similar:

def intToRoman(self, num: int) -> str:
ans=[]
roman = {1000:'M', 900:'CM', 500:'D', 400:'CD', 100:'C', 90:'XC', 50:'L', 40:'XL', 10:'X', 9:'IX', 5:'V', 4:'IV', 1:'I'}
for k, v in roman.items():
ans.append(num//k*v)
num%=k
return "".join(ans)
also I would argue that time is O(1) as there is a finite set of Roman numerals therefore Space is also constant

VladBurlutsky

Hi Tim I have a coming interview with FB, what do you recommend me to study? Which algo? This is for DE not SWE. Thanks and congrats on your channel

toniomz

when i run the program it says "def intToRoman(self, num: int) -> str:" has a syntax error. any idea why?

bradendavis

Hey Tim, isn't this cheating tho. I couldn't figure out a way to solve it without keeping all the possible Roman numerals in the lookup either.

My binary search solution. I think it is faster for the case if the number is 1001.

class Solution:
def intToRoman(self, num: int) -> str:
values = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000]
numerals = ['I', 'IV', 'V', 'IX', 'X', 'XL', 'L', 'XC', 'C', 'CD', 'D', 'CM', 'M']

number=""
idx=-1
while num!=0:
if num >= values[idx]:
number+=numerals[idx]
num-=values[idx]
else:
idx=bisect.bisect(values, num, hi=idx)-1

return number

CEOofTheHood

Hey, Great video, +sub and like, for noob for me it would be great if u explained the details a bit more while writing the code.

sinnyman

Leetcode - Integer to Roman (Python)

Integer to Roman - Leetcode 12 - Python

Leetcode - Integer to Roman (Python)

Integer to Roman | Leetcode #12

LeetCode 12 | Integer to Roman (Java)

Roman to Integer - Leetcode 13 - Python

LeetCode Coding Problem | Integer to Roman

Roman to Integer | Leetcode -13 | Algorithms Made Easy

Convert Integer to Roman numeral - LeetCode Interview Coding Challenge [Java Brains]

Integer to Roman 🔥 | Leetcode 12 (Medium) | Java

Integer to Roman | Live Coding with Explanation | Leetcode - 12

LeetCode 12 Integer To Roman | Strings | C++ [ Algorithm + Code explanation]

Integer to Roman - LeetCode 12 - Coding Interview Questions

Convert Integer to Roman Numeral | Integer to Roman LeetCode | Programming Tutorials

leetCode 12 - Integer to Roman (get the last digit and sum up) | JSer - algorithm & JavaScript

Leetcode: Integer to Roman | Rust (Medium)

Roman to Integer - LeetCode 13 | Java

[LEET] Code with me #12 (Integer to Roman)

Amazon Coding Interview Question - Integer to Roman (LeetCode)

Leetcode Question 12 'Integer to Roman' in Javascript

Integer to Roman -(Amazon, Facebook, Microsoft, Twitter, Apple, Google..): Explanation ➕ Live Coding...

Leetcode 12 : Integer to Roman Solved in Java

Roman Numeral To Integer - LeetCode Algorithm Solution + Code Vanilla Javascript

Leetcode - Roman to Integer (Python)

LeetCode - Integer to Roman (#12) in TypeScript/JavaScript