题目:
思路:
数组的不算该元素的乘积,等于左侧数乘积乘以右侧数乘积,两次遍历可得结果
代码:
class Solution {
public int[] productExceptSelf(int[] nums) {
int[] left = new int[nums.length];
int right = 1;
left[0] = 1;
for(int i = 1; i < left.length; i++) {
left[i] = left[i - 1] * nums[i - 1];
}
for(int i = left.length - 2; i >= 0; i--) {
right *= nums[i + 1];
left[i] *= right;
}
return left;
}
}