Ugly Number II

Author: vikash212000yadav

July_4.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int nthUglyNumber(int n) {
+        if(n <= 6) 
+            return n;
+        
+        int i2 = 0, i3 = 0, i5 = 0, i = 1;
+        int ugly[n];
+        ugly[0] = 1;
+        
+        while(i < n)
+        {
+            int n2 = 2*ugly[i2], n3 = 3*ugly[i3], n5 = 5*ugly[i5];
+            int temp = min(n2, min(n3, n5));
+            ugly[i++] = temp;
+            if(temp == n2) i2++;
+            if(temp == n3) i3++;
+            if(temp == n5) i5++;
+        }
+        return ugly[n-1];
+    }
+};

README.md

@@ -6,3 +6,5 @@
 	- [Binary Tree Level Order Traversal II](https://www.geeksforgeeks.org/reverse-level-order-traversal/)
 3. July 3
 	- [Prison Cells After N Days](https://medium.com/@akshay_ravindran/day-31-prison-cells-after-n-days-6954ed481483)
+4. July 4
+	- [Ugly Number II](https://www.geeksforgeeks.org/ugly-numbers/)