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].
Follow up:
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.)
对于一个数组中的每个元素做运算: 每个元素替换为数组中除该元素之外的所有元素的乘积
自己做出来的 和答案基本一致 很不错
基本想法是把product分为前后两部分 dp求解 第一次遍历记录前面的product 第二遍从后向前
public int[] productExceptSelf(int[] nums) {
int n = nums.length;
int[] res = new int[n];
res[0] = 1;
for (int i = 1; i < n; i++) {
res[i] = res[i - 1] * nums[i - 1];
}
int right = 1;
for (int i = n - 1; i >= 0; i--) {
res[i] *= right;
right *= nums[i];
}
return res;
}
第一遍 res[i]存的是i前面所有数字的乘积
第二遍 res[i]又乘上了i后面所有数字的乘积