码迷,mamicode.com
首页 > 其他好文 > 详细

238. Product of Array Except Self

时间:2016-07-07 00:38:48      阅读:157      评论:0      收藏: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 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.)

 

 
Hide Tags
 Array
 
 

238. Product of Array Except Self

标签:

原文地址:http://www.cnblogs.com/neweracoding/p/5648429.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!