*Leetcode 238. Product of Array Except Self

最新推荐文章于 2023-07-23 12:04:58 发布

Z-Pilgrim

最新推荐文章于 2023-07-23 12:04:58 发布

阅读量125

点赞数

分类专栏： LeetCode题解

本文链接：https://blog.csdn.net/u011026968/article/details/79605095

版权

LeetCode题解专栏收录该内容

271 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/product-of-array-except-self/description/

这题不知道怎么说，我是踩了这个题的。感觉很没意思，但是看了discuss的solution 写法很巧妙

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        vector <int> ret;
        if (nums.size() == 0) return ret;
        long long rslt = 1;
        int sum = 0;
        for (int i  = 0; i < nums.size(); i++) {
            if (nums[i])
                rslt *= nums[i];
            else
                sum++;
        }
        if (sum > 1) rslt = 0;
        
        for (int i = 0; i < nums.size(); i++) {
            if (sum) {
                if (nums[i] == 0) {
                    ret.push_back(rslt);
                } else {
                    ret.push_back( 0 );
                }
            } else {
                ret.push_back( rslt/nums[i] );
            }

        }
        return ret;
    }
};

https://leetcode.com/problems/product-of-array-except-self/discuss/65627/O(n)-time-and-O(1)-space-C++-solution-with-explanation

这里有个很有意思的解法，一次循环解决：

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int n=nums.size();
        int fromBegin=1;
        int fromLast=1;
        vector<int> res(n,1);
        
        for(int i=0;i<n;i++){
            res[i]*=fromBegin;
            fromBegin*=nums[i];
            res[n-1-i]*=fromLast;
            fromLast*=nums[n-1-i];
        }
        return res;
    }
};