LeetCode 238. Product of Array Except Self

最新推荐文章于 2021-10-11 11:07:24 发布

sqyx008

最新推荐文章于 2021-10-11 11:07:24 发布

阅读量208

点赞数

分类专栏： LeetCode 文章标签： leetcode product cpp array

本文链接：https://blog.csdn.net/sqyx008/article/details/66477558

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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].

Analysis

Avoid repeatitive multiple. Therefore, set two arrays to storage the forward or backward results. The formula is

F o r w a r d P r o d u c t [i] = {F o r w a r d P r o d u c t [i - 1] \times n u m s [i] n u m s [0] (i = 1, . . . n - 2) (i = 0)

$ForwardProduct[i]=\left\{ \begin{aligned} ForwardProduct[i-1]\times nums[i] &&(i=1,...n-2)\\ nums[0]&&(i=0) \end{aligned} \right.$

B a c k w a r d P r o d u c t [i] = {B a c k w a r d P r o d u c t [i + 1] \times n u m s [i + 1] n u m s [n - 1] (i = 0, . . . n - 3) (i = n - 2)

$BackwardProduct[i]=\left\{ \begin{aligned} BackwardProduct[i+1]\times nums[i+1] &&(i=0,...n-3)\\ nums[n-1]&&(i=n-2) \end{aligned} \right.$

Code

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {

        // pf(i):forward product from nums[0] to nums[i]
        // pb(i):back product from nums[n-1] downto nums[i+1]

        int n = nums.size();
        vector<int> pf(n-1),pb(n-1),result;

        pf[0]=nums[0];
        pb[n-2]=nums[n-1];
        for (int i=1;i<n-1;i++){
            pf[i]=pf[i-1]*nums[i];
        }
        for (int i=n-3;i>=0;i--){
            pb[i]=pb[i+1]*nums[i+1];
        }

        result.push_back(pb[0]);
        for (int i=1;i<n-1;i++){
            result.push_back(pf[i-1]*pb[i]);
        }
        result.push_back(pf[n-2]);
        return result;
    }
};