38_Product_Array_Puzzle

#User function Template for python3

class Solution:
    def productExceptSelf(self, nums, n):
        #code here
        count0=0
        p=1
        for t in nums:
            if t!=0:
                p*=t
            else:
                count0+=1
        ans=[]
        for i in range(n):
            if count0>1:
                ans.append(0)
            elif nums[i]==0:
                ans.append(p)
            else:
                if count0<1:
                    ans.append(p//nums[i])
                else:
                    ans.append(0)
        return ans