[LeetCode] 238. Product of Array Except Self

Loong_T 發布于2019-08-14 14:32 / 1810人閱讀

Problem

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

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

Solution

class Solution {
    public int[] productExceptSelf(int[] nums) {
        int n = nums.length;
        int[] res = new int[n];
        res[0] = 1;
        for (int i = 1; i < n; i++) res[i] = res[i-1]*nums[i-1];
        int right = 1;
        for (int i = n-1; i >= 0; i--) {
            res[i] *= right;
            right *= nums[i];
        }
        return res;
    }
}

云服務器 GPU云服務器 Except LeetCode Product LeetCode_String

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/65071.html

【Python】LeetCode 238. Product of Array Except Self

摘要：題目描述題目解析簡單來說就是對于數組中每一項，求其他項之積。算一遍全部元素的積再分別除以每一項要仔細考慮元素為零的情況。沒有零直接除下去。一個零零的位置對應值為其他元素之積，其他位置為零。兩個以上的零全部都是零。題目描述 Given an array of n integers where n > 1, nums, return an array output such that o...

kaka 2019-07-31 12:22 評論0 收藏0
LeetCode 238 Product of Array Except Self

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

henry14 2019-08-14 17:43 評論0 收藏0
238. Product of Array Except Self

問題：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)....

劉永祥 2019-08-14 14:18 評論0 收藏0
[LeetCode] Product of Array Except Self

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

golden_hamster 2019-08-16 11:14 評論0 收藏0
[Leetcode] Product of Array Except Self 自身以外的數組乘積

摘要：動態規劃復雜度時間空間思路分析出自身以外數組乘積的性質，它實際上是自己左邊左右數的乘積，乘上自己右邊所有數的乘積。所以我們可以用一個數組來表示第個數字前面數的乘積，這樣。同理，我們可以反向遍歷一遍生成另一個數組。 Product of Array Except Self Given an array of n integers where n > 1, nums, return an...

rockswang 2019-08-14 12:34 評論0 收藏0