LeetCode238：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.)

---

LeetCode：链接

这道题就是剑指Offer_编程题51：构建乘积数组，分别计算上三角和下三角的值，然后乘在一起。

class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        tmp = 1
        res = [0] * len(nums)
        for i in range(len(nums)):
            res[i] = tmp
            tmp *= nums[i]
        tmp = 1
        for i in range(len(nums)-1, -1, -1):
            res[i] *= tmp 
            tmp *= nums[i] 
        return res