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
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 508 Views, 19404 Search Bots | 92 Words
| 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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 508 Views, 19404 Search Bots | 92 Words 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
Related Articles
- ImageMagick Vulnerabilities - CVE-2016–3714
- Daily Interview Problem: Queue Using Two Stacks
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: Min Stack
- 56 Bytes
- Top K Frequent words
- Multitasking
- Algorithm Interview Question: H-Index
- [Daily Problem] Witness of The Tall People
- Daily Interview Puzzle: Ways to Traverse a Grid
©2006~2024 SteakOverCooked - 0.00701 Seconds(s) - 2747.697 KB/s - 7 Online Memory: 493.59 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !