{leetcode}/problems/product-of-array-except-self/[LeetCode - 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.)
- 一刷
-
link:{sourcedir}/_0238_ProductOfArrayExceptSelf.java[role=include] - 二刷
-
link:{sourcedir}/_0238_ProductOfArrayExceptSelf_2.java[role=include]
该题的思路也适用于 724. Find Pivot Index。