leetcode.jp 博客
本网站所有文字及图片内容均来自网络,每周定时更新,仅供个人学习与研究,请勿用于商业用途。谢谢合作。

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

Difficulty:

Medium

Lock:

Normal

Company:

Adobe Amazon Apple Asana BlackRock Bloomberg eBay Evernote Facebook Goldman Sachs Google Grab Groupon Hulu Intel LinkedIn Lyft Microsoft Nutanix Oracle Paypal Qualtrics Salesforce Snapchat Splunk Tableau Visa VMware Walmart Labs Yahoo Yelp Zenefits

Solution(Chinese):

LEETCODE 238. Product of Array Except Self 解题思路分析