Given an array of numbers nums of size n, find products where products[i] is product of all nums[j] where j != i.

Given an array of numbers nums of size n, find products where products[i] is product of all nums[j] where j != i.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

分类: problem-solving

标签: Apple SWE, Algorithms

目标岗位: Software Engineer

目标公司: Apple

参考答案摘要

解题思路：Prefix and suffix products: first pass build prefix, second pass multiply by suffix running product. O(n) time, O(1) extra besides output.

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。