LeetCode题解: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 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.)

题意:给定一个数组,长度大于1.求出除开某个元素的乘积,用数组记录。要求O(1)空间(不考虑输出数组)

解题思路:两次遍历该数组,设当前数组索引为i,第一次求出小于i的所有元素的乘积,第二次求出大于i所有元素的乘积

代码:

public class Solution {
    public int[] productExceptSelf(int[] nums) {
        int[] output = new int[nums.length];
        output[0] = 1;

        for(int i = 1; i < nums.length; i++){
            output[i] = output[i - 1] * nums[i - 1];
        }

        int right = 1;
        for(int i = nums.length - 1; i >= 0; i--){
            output[i] *= right;
            right *= nums[i];
        }

        return output;
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值