代码拉取完成,页面将自动刷新
同步操作将从 doocs/leetcode 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
Given an integer array nums
, return an array answer
such that answer[i]
is equal to the product of all the elements of nums
except nums[i]
.
The product of any prefix or suffix of nums
is guaranteed to fit in a 32-bit integer.
Example 1:
Input: nums = [1,2,3,4] Output: [24,12,8,6]
Example 2:
Input: nums = [-1,1,0,-3,3] Output: [0,0,9,0,0]
Constraints:
2 <= nums.length <= 105
-30 <= nums[i] <= 30
nums
is guaranteed to fit in a 32-bit integer.
Follow up:
O(n)
time complexity and without using division?O(1)
constant space complexity? (The output array does not count as extra space for space complexity analysis.)class Solution:
def productExceptSelf(self, nums: List[int]) -> List[int]:
n = len(nums)
output = [1 for _ in nums]
left = right = 1
for i in range(n):
output[i] = left
left *= nums[i]
for i in range(n - 1, -1, -1):
output[i] *= right
right *= nums[i]
return output
class Solution {
public int[] productExceptSelf(int[] nums) {
int n = nums.length;
int[] output = new int[n];
for (int i = 0, left = 1; i < n; ++i) {
output[i] = left;
left *= nums[i];
}
for (int i = n - 1, right = 1; i >= 0; --i) {
output[i] *= right;
right *= nums[i];
}
return output;
}
}
/**
* @param {number[]} nums
* @return {number[]}
*/
var productExceptSelf = function (nums) {
const n = nums.length;
let output = new Array(n);
for (let i = 0, left = 1; i < n; ++i) {
output[i] = left;
left *= nums[i];
}
for (let i = n - 1, right = 1; i >= 0; --i) {
output[i] *= right;
right *= nums[i];
}
return output;
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。