To the Top
File:  root - text - article - 2019 - 12 - product-of-array-except-self.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 201 Views, 17610 Search Bots | 79 Words

Subscribe to Feed Burner | Browse | Archive
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:


def products(nums):
# Fill this in.

print products([1, 2, 3, 4, 5])
# [120, 60, 40, 30, 24]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 201 Views, 17610 Search Bots | 79 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Sort Colors
  2. Spreadsheet Column Title
  3. Find Missing Numbers in an Array
  4. Daily Interview Problem: Merge List Of Number Into Ranges
  5. Daily Interview Problem: Tree Serialization
  6. Binary Tree Level with Minimum Sum
  7. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  8. [Daily Problem] Witness of The Tall People
  9. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  10. Daily Interview Puzzle: Ways to Traverse a Grid

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">