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 | 219 Views, 18268 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 | 219 Views, 18268 Search Bots | 79 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Deepest Node in a Binary Tree
  2. Fix Brackets
  3. Daily Interview Problem: Spiral Traversal of Grid
  4. Daily Interview Question: Find Cycles in a Graph
  5. Daily Interview Problem: Validate Binary Search Tree
  6. Daily Interview Problem: Largest BST in a Binary Tree
  7. Daily Interview Problem: Queue Using Two Stacks
  8. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  9. Daily Interview Problem: 3 Sum
  10. Daily Interview Problem: Min Stack

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="noindex, follow" />