https://leetcode.com/problems/product-of-array-except-self/#/description
计算数组中除本身以外的所有数字之积
要求:不允许用除法;O(n)
思路:将乘法拆开,分为该数字的前一部分和后一部分。那么开两个数组,forword表示从前往后的乘积,backword表示从后往前的乘积。最后将两个相乘就得到结果。
public class Solution {
public int[] productExceptSelf(int[] nums) {
int length = nums.length;
int []res = new int[length];
int []forword = new int[length];//从前往后
int []backword = new int[length];//从后往前
forword[0] = backword[length-1] = 1;
for(int i = 1;i < nums.length;i ++){
forword[i] = forword[i-1] * nums[i-1];
}
for(int i = nums.length-2;i >= 0;i --){
backword[i] = backword[i+1] * nums[i+1];
}
for(int i = 0;i < nums.length;i ++){
res[i] = forword[i] * backword[i];
}
return res;
}
}