To the Top
File:  root - text - article - 2019 - 11 - maximum-profit-from-stocks.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 508 Views, 19404 Search Bots | 92 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Apple:

You are given an array. Each element represents the price of a stock on that particular day. Calculate and return the maximum profit you can make from buying and selling that stock only once.

For example: [9, 11, 8, 5, 7, 10]

Here, the optimal trade is to buy when the price is 5, and sell when it is 10, so the return value should be 5 (profit = 10 - 5 = 5).

Here's your starting point:


def buy_and_sell(arr):
#Fill this in.

print buy_and_sell([9, 11, 8, 5, 7, 10])
# 5
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 508 Views, 19404 Search Bots | 92 Words Subscribe to Feed Burner

Related Articles

  1. ImageMagick Vulnerabilities -  CVE-2016–3714
  2. Daily Interview Problem: Queue Using Two Stacks
  3. [Daily Problem] Longest Increasing Subsequence
  4. Daily Interview Problem: Min Stack
  5. 56 Bytes
  6. Top K Frequent words
  7. Multitasking
  8. Algorithm Interview Question: H-Index
  9. [Daily Problem] Witness of The Tall People
  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="noindex, follow" />