Write a Python program to find the nth ugly number using Heap queue algorithm.

 WRITE A PYTHON PROGRAM TO FIND THE nTH UGLY NUMBER USING HEAP QUEUE ALGORITHM.

INPUT:

import heapq

class Solution(object):      

      #:type n: integer

      #:return type: integer      

   def nth_Ugly_Number(self, n):

       ugly_num = 0

       heap = []

       heapq.heappush(heap, 1)

       for _ in range(n):

           ugly_num = heapq.heappop(heap)

           if ugly_num % 2 == 0:

               heapq.heappush(heap, ugly_num * 2)

           elif ugly_num % 3 == 0:

               heapq.heappush(heap, ugly_num * 2)

               heapq.heappush(heap, ugly_num * 3)

           else:

               heapq.heappush(heap, ugly_num * 2)

               heapq.heappush(heap, ugly_num * 3)

               heapq.heappush(heap, ugly_num * 5)

               return ugly_num

n = 7

S = Solution()

result = S.nth_Ugly_Number(n)

print("7th Ugly number:")

print(result)

n = 10

result = S.nth_Ugly_Number(n)

print("\n10th Ugly number:")

print(result)

OUTPUT:

                                    THANK YOU..!!💫