LeetCode刷题【Array】 Product of Array Except Self

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

SimonCode

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

阅读量255

点赞数

分类专栏： LeetCode 文章标签： Array leetcode

本文链接：https://blog.csdn.net/ltxiaoxia/article/details/64439538

版权

LeetCode 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

题目：

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

解决方法一： Runtime: 2 ms

public class Solution {
    public int[] productExceptSelf(int[] nums) {
        if(null==nums) return null;
		int[] ret = new int[nums.length];
		for(int i=0;i<nums.length;i++) ret[i]=1;
		int sum=1;
		for(int i=1;i<nums.length;i++){
			sum*=nums[i-1];
			ret[i]=sum;
		}
		sum=1;
		for(int j=nums.length-2;j>=0;j--){
			sum*=nums[j+1];
			ret[j]*=sum;
		}
		return ret;
    }
}

参考：

【1】https://leetcode.com/