Skip to main content

12. Integer to Roman | Leetcode solution

 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, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 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 an integer, convert it to a roman numeral.

 

Example 1:

Input: num = 3
Output: "III"
Explanation: 3 is represented as 3 ones.

Example 2:

Input: num = 58
Output: "LVIII"
Explanation: L = 50, V = 5, III = 3.

Example 3:

Input: num = 1994
Output: "MCMXCIV"
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

 

Constraints:

  • 1 <= num <= 3999

Solution :

class Solution {
public:
    string intToRoman(int num) {
        
        
      string s ="";
       while(true)
       {
           if(num == 0)
           {
                return s;
           }
           if(num >= 1 && num < 5)
           {   
               if(num == 4)
               {
                   s += "IV";
                   num -= 4;
               }
               else
               {
               s += 'I';
               num -= 1;
               }
           }
           if(num >= 5 && num < 10)
           {   
               if(num == 9)
               {
                   s += "IX";
                   num -= 9;
               }
               else
               {
               s += 'V';
               num -= 5;
               }
           }
           if(num >= 10 && num < 50)
           {   
               if(num >=40)
               {
                   s += "XL";
                   num -= 40;
               }
               else
               {
               s += 'X';
               num -= 10;
               }
           }
           if(num >= 50 && num < 100)
           {   
               if(num >= 90)
               {
                   s += "XC";
                   num -= 90;
               }
               else
               {
               s += 'L';
               num -= 50;
               }
           }
           if(num >= 100 && num < 500)
               
           {   
               if(num >= 400)
               {
                   s += "CD";
                   num -= 400;
               }
               else
               {
               s += 'C';
               num -= 100;
               }
           }
           if(num >= 500 && num < 1000)
           {   
               if(num >= 900)
               {
                   s += "CM";
                   num -= 900;
               }
               else
               {
               s += 'D';
               num -= 500;
               }
           }
           if(num >= 1000)
           {
               s += 'M';
               num -= 1000;
           }
           
       }
        return s;
    }
};






Comments

Popular posts from this blog

[PDF DOWNLOAD] AKTU Quantum series data structure b.tech 2nd year download

  All AKTU Quantums are available here. Get your hands on AKTU Quantums and boost your grades in AKTU semester exams. You can either search them category wise or can use the search bar or can manually search on this page. Download aktu second year quantum pdf data structures  download  data structures quantum aktu download aktu data structures quantum click here to download  write in comment section if you want quantum of any other subject.

2485. Find the Pivot Integer | Binary search

  Given a positive integer   n , find the   pivot integer   x   such that: The sum of all elements between  1  and  x  inclusively equals the sum of all elements between  x  and  n  inclusively. Return  the pivot integer  x . If no such integer exists, return  -1 . It is guaranteed that there will be at most one pivot index for the given input.   Example 1: Input: n = 8 Output: 6 Explanation: 6 is the pivot integer since: 1 + 2 + 3 + 4 + 5 + 6 = 6 + 7 + 8 = 21. Example 2: Input: n = 1 Output: 1 Explanation: 1 is the pivot integer since: 1 = 1. Example 3: Input: n = 4 Output: -1 Explanation: It can be proved that no such integer exist.   Constraints: 1 <= n <= 1000 Solution : class Solution { publ ic:     int pivotInteger( int n ) {         int sum = (( n )*( n + 1 ))/ 2 ;         int i = 1 ;         int j =...

leetcode 48 solution

  48 .  Rotate Image You are given an  n x n  2D  matrix  representing an image, rotate the image by  90  degrees (clockwise). You have to rotate the image  in-place , which means you have to modify the input 2D matrix directly.  DO NOT  allocate another 2D matrix and do the rotation.   Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [[7,4,1],[8,5,2],[9,6,3]] Example 2: Input: matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]] Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]   Constraints: n == matrix.length == matrix[i].length 1 <= n <= 20 -1000 <= matrix[i][j] <= 1000 solution: class Solution { public:     void swap(int& a , int &b)     {         int c ;         c = a;         a = b;         b = c;     }     void transpose (vector<vector<int>...