## 238. Product of Array Except Self
#
# Given an array nums of n integers where n > 1,  return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
#
# Example:
#
#     Input:  [1,2,3,4]
#     Output: [24,12,8,6]
#
# Note: Please solve it without division and in O(n).
#
# Follow up:
# Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)
##


class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        result = [1] * len(nums)

        product = 1
        for i in range(len(nums)):
            result[i] *= product
            product *= nums[i]

        product = 1
        for i in range(len(nums)-1, -1, -1):
            result[i] *= product
            product *= nums[i]

        return result


if __name__ == "__main__":
    arr1 = [1, 2, 3, 4]
    print(Solution().productExceptSelf(arr1))

