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].
public class Solution { public int[] productExceptSelf(int[] nums) { int size = nums.length; int[] front = new int[size]; int[] re = new int[size]; front[0] = 1; for(int i=1;i<size;i++) { front[i] = front[i-1]*nums[i-1]; } int mutiply = 1; for(int i=size-1;i>=0;i--) { re[i] = front[i]*mutiply; mutiply = mutiply*nums[i]; } return re; } }
原文：http://www.cnblogs.com/mrpod2g/p/4802906.html