LeetCode刷题MEDIM篇Product of Array Except

题目

Given an > 1, an [i]is equal to the of all the [i].

:

Input:  [1,2,3,4]
Output: [24,12,8,6]

Note: solve in O(n).

up:

Could you solve it with space ? (The as extra space for the of space .)

十分钟尝试

本来第一反应，当前元素输出值应该是全部的除以当前元素，以为很完美可以处理，写完发现，忽略了一个0，如果有0我的代码不行，为了排除0，写了分支条件，还是不行。

class Solution {public int[] productExceptSelf(int[] nums) {int[] output=new int[nums.length];int allProduct=1;int allProductExceptZero=1;//如果有0不对for(int i=0;i

class Solution {public int[] productExceptSelf(int[] nums) {int[] res=new int[nums.length];res[0]=1;for(int i=1;i=0;j--){res[j]*=right;right*=nums[j];}return res;}
}