本文探讨了如何在不使用除法的情况下，给定一个整数数组，返回一个新数组，其中每个元素是原始数组中除当前位置外所有元素的乘积。例如，输入[1,2,3,4,5]，输出应为[120,60,40,30,24]。文章提供了理解和解决这一复杂问题的方法。
Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i.
For example, if our input was [1, 2, 3, 4, 5], the expected output would be [120, 60, 40, 30, 24]. If our input was [3, 2, 1], the expected output would be [2, 3, 6].
Follow-up: what if you can't use division?
扫一扫
755
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
