文件: root - text - article - 2019 - 12 - product-of-array-except-self.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 220 次阅读, 18301 次搜索 | 79 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 220 次阅读, 18301 次搜索 | 79 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Amazon:
You are given an array of integers. Return an array of the same size where the element at each index is the product of all the elements in the original array except for the element at that index.
For example, an input of [1, 2, 3, 4, 5] should return [120, 60, 40, 30, 24].
You cannot use division in this problem.
Here's a start:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 220 次阅读, 18301 次搜索 | 79 个单词 You are given an array of integers. Return an array of the same size where the element at each index is the product of all the elements in the original array except for the element at that index.
For example, an input of [1, 2, 3, 4, 5] should return [120, 60, 40, 30, 24].
You cannot use division in this problem.
Here's a start:
def products(nums):
# Fill this in.
print products([1, 2, 3, 4, 5])
# [120, 60, 40, 30, 24]
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Algorithm Interview: Longest Consecutive Sequence
- Daily Interview Question: Find Cycles in a Graph
- [Daily Problem] Longest Palindromic Substring
- Daily Interview Problem: Trapping Rainwater
- Daily Interview Problem: Merge List Of Number Into Ranges
- Daily Interview Problem: Merge K Sorted Linked Lists
- Algorithm Interview Question: H-Index
- [Daily Problem] Course Prerequisites
- Algorithm Interview: No Adjacent Repeating Characters
©2006~2024 牛排过熟 - 0.01225 秒 - 4434.624 KB/s - 124 在线
内存: 517.63 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。