首页 > 其他 > 详细

238. Product of Array Except Self

时间:2016-07-07 00:38:28      阅读:216      评论: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
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!