Roman to Integer LeetCode 13 Java

YOUR LINK HERE:

http://youtube.com/watch?v=k4KgVd5LQk8

Question: https://leetcode.com/problems/roman-t... • Today I solve and explain a Easy level difficulty leetcode SQL problem using Java called 13. Roman to Integer • The approach I took was using a switch case to quickly translate the characters to it's corresponding integer value. With every iteration I look up the integer translation and add it to the count. • The main trick is that if the previous number is smaller than the current number we want to decrement the current running sum by the previous number. Otherwise we simply add the current number. • Time complexity: O(N) • Space complexity: O(1) • Code Solution Post: (Sign into LeetCode to view) • https://leetcode.com/problems/roman-t... • Checkout my Blog Post: Reflecting on 1 Year of LeetCode • / reflecting-on-1-year-of-leetcode • If you found this helpful Like and Subscribe! I solve LeetCode Algorithms and SQL Problems daily! • #leetcode #java #tutorial #leetcode #algorithm #faang

#############################

New on site