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

Related Articles

  1. Palindrome Integers
  2. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  3. Invert a Binary Tree
  4. Daily Interview Puzzle: Minimum Size Subarray Sum
  5. Multitasking
  6. [Daily Problem] Angles of a Clock
  7. Spreadsheet Column Title
  8. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  9. Daily Interview Problem: Longest Substring With K Distinct Characters
  10. First and Last Indices of an Element in a Sorted Array

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">