# [LeetCode]238. Product of Array Except Self 将数组中除了自己以外的数字相乘

### 题目地址：(?)

https://leetcode.com/problems/product-of-array-except-self/

### 题目描述：

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)

“（引用）

### 复杂度分析

（这里在求右边数组 right 的时候直接简化了算法，不写 right ，而是直接赋值 result 数组，节省了一部分空间）