Pow(n,x).py

# Question link - https://leetcode.com/problems/powx-n/description/?envType=study-plan-v2&envId=top-interview-150

class Solution(object):
    def myPow(self, x, n):
        """
        :type x: float
        :type n: int
        :rtype: float
        """
        # Sol2 :O(logN)
        # Using the recursive function , with divide and conquer concepts 
        def helper(x , n):
            # Basecase 
            if x == 0: return 0
            if n == 0 : return 1

            # recursive call , by multipying itself  
            res = helper(x * x , n // 2)
            # return the result if n is even , otherwise 
            return x * res if n % 2 else res


        # Function call 
        res = helper(x , abs(n))
        # Return the res if +ve n or else return 1 / res if -ve n 
        return res if n >= 0 else 1 / res

        # Sol1 
        # if n == 0:
        #     return 1.0
        # elif n < 0:
        #     x = 1 / x
        #     n = -n
        
        # result = 1.0
        # current_product = x
        
        # while n > 0:
        #     if n % 2 == 1:  # If n is odd
        #         result *= current_product
        #     current_product *= current_product  # Square the base
        #     n //= 2  # Divide n by 2
        # return result