leetcode:238. Product of Array Except Self(Java)解答

原创 2016年03月05日 14:14:02

转载请注明出处:z_zhaojun的博客
原文地址
题目地址
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.)

Subscribe to see which companies asked this question

解法(java):

public int[] productExceptSelf(int[] nums) {
        // if (nums == null || nums.length < 2) {
        //     return null;
        // }
        int first = nums[0];
        int product = 1;
        int numZero = 0;
        for (int val : nums) {
            if (val == 0) {
                numZero++;
                if (numZero == 2) {
                    break;
                }
            } else {
                product *= val;
            }
        }
        nums[0] = (numZero == 2) ? 0 : (numZero == 0 ? product / first : (first == 0 ? product : 0));
        for (int i = 1; i < nums.length; i++) {
            nums[i] = (numZero == 2) ? 0 : (numZero == 0 ? product / nums[i] : (nums[i] == 0 ? product : 0));
        }
        return nums;
    }
版权声明:本文为博主原创文章,转载请注明出处。博客首页:http://blog.csdn.net/u012975705。订阅:http://blog.csdn.net/u012975705/rss/list

LeetCode-238. Product of Array Except Self (JAVA)(构建乘积数组)

LeetCode-238. Product of Array Except Self (JAVA)(构建乘积数组) 剑指offer

LeetCode238 Product of Array Except Self(java and python solution)

题目要求: Given an array of n integers where n > 1, nums, return an array output such that output[i] is...

Leetcode_238_Product of Array Except Self

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/48598939 Given an array of...

LeetCode- 238. Product of Array Except Self

Problem: Given an array of n integers where n > 1, nums, return an array output such that outpu...

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

<LeetCode OJ> 238. Product of Array Except Self

238. Product of Array Except Self My Submissions Question Total Accepted: 31438 Total Submission...

LeetCode笔记:238. Product of Array Except Self

计算除了该元素以外所有元素的乘积

LeetCode 238 Product of Array Except Self(除自身外数组其余数的乘积)

翻译给定一个有n个数字的数组nums,其中n大于1,返回一个数组使得output[i]等于除nums[i]外所有元素的乘积。不用分治并且在O(n)复杂度下解决这个问题。例如,给定[1, 2, 3, 4...
  • NoMasp
  • NoMasp
  • 2016年03月05日 20:38
  • 2025

LeetCode 238. Product of Array Except Self 题解(C++)

LeetCode 238. Product of Array Except Self 题解(C++)题目描述 Given an array of n integers where n > 1, num...

LeetCode 238. Product of Array Except Self 解题报告

LeetCode 238. Product of Array Except Self 解题报告
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode:238. Product of Array Except Self(Java)解答
举报原因:
原因补充:

(最多只允许输入30个字)