# leetcode：238. Product of Array Except Self（Java）解答

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

Subscribe to see which companies asked this question

public int[] productExceptSelf(int[] nums) {
// if (nums == null || nums.length < 2) {
//     return null;
// }
int first = nums[0];
int product = 1;
int numZero = 0;
for (int val : nums) {
if (val == 0) {
numZero++;
if (numZero == 2) {
break;
}
} else {
product *= val;
}
}
nums[0] = (numZero == 2) ? 0 : (numZero == 0 ? product / first : (first == 0 ? product : 0));
for (int i = 1; i < nums.length; i++) {
nums[i] = (numZero == 2) ? 0 : (numZero == 0 ? product / nums[i] : (nums[i] == 0 ? product : 0));
}
return nums;
}

## LeetCode-238. Product of Array Except Self (JAVA)（构建乘积数组）

LeetCode-238. Product of Array Except Self (JAVA)（构建乘积数组） 剑指offer

## LeetCode- 238. Product of Array Except Self

Problem: Given an array of n integers where n > 1, nums, return an array output such that outpu...

## <LeetCode OJ> 238. Product of Array Except Self

238. Product of Array Except Self My Submissions Question Total Accepted: 31438 Total Submission...

## LeetCode 238 Product of Array Except Self（除自身外数组其余数的乘积）

• NoMasp
• 2016年03月05日 20:38
• 2025

## LeetCode 238. Product of Array Except Self 题解（C++）

LeetCode 238. Product of Array Except Self 题解（C++）题目描述 Given an array of n integers where n > 1, num...

## LeetCode 238. Product of Array Except Self 解题报告

LeetCode 238. Product of Array Except Self 解题报告

举报原因： 您举报文章：leetcode：238. Product of Array Except Self（Java）解答 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)