题目描述:
给你一个长度为 n 的整数数组 nums,其中 n > 1,返回输出数组 output ,其中 output[i] 等于 nums 中除 nums[i] 之外其余各元素的乘积。
解析:
1.首先定义一个数组,是数组里初始值都为1
2.遍历数组,先从左往右,使每个result[i]的值为前i-1个num[i]的乘积
3.然后再从右往左,使每个result[i]的值为后i+1个nums[i]的乘积
4.最后返回result即可
Java:
public int[] productExceptSelf(int[] nums) {
int[] result = new int[nums.length];
Arrays.fill(result, 1);
int product = 1;
for(int i = 0; i < nums.length; i++) {
result[i] = result[i] * product;
product = product * nums[i];
}
product = 1;
for(int i = nums.length - 1; i >= 0; i--) {
result[i] = result[i] * product;
product = product * nums[i];
}
return result;
}
JavaScript:
var productExceptSelf = function(nums) {
const result = Array(nums.length).fill(1);
let product = 1;
for(let i = 0; i < nums.length; i++) {
result[i] = result[i] * product;
product = product * nums[i];
}
product = 1;
for(let i = nums.length - 1; i >= 0; i--) {
result[i] = result[i] * product;
product = product * nums[i];
}
return result;
};