9.13练手腾讯50题 238 除了自己之外的乘积

最新推荐文章于 2024-09-13 20:39:08 发布

vancooler

最新推荐文章于 2024-09-13 20:39:08 发布

阅读量87

点赞数

分类专栏：算法练手

本文链接：https://blog.csdn.net/vancooler/article/details/100812520

版权

算法练手专栏收录该内容

49 篇文章 0 订阅

订阅专栏

Leetcode 238. Product of Array Except Self

Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:
Input:
[1,2,3,4]
Output:
[24,12,8,6]
Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

注意结果的拆分，不用重复运算乘积，代码如下：

class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        n = len(nums)
        if(n == 2):
            return [nums[1], nums[0]]
        result = [1] * n
        k = 1
        for i in range(n):
            result[i] = k
            k = k * nums[i]
        
        k = 1
        for i in range(n-1,-1,-1):
            result[i] *= k
            k = k * nums[i]
        
        return result