文件: root - text - article - 2019 - 11 - maximum-profit-from-stocks.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 494 次阅读, 18086 次搜索 | 92 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 494 次阅读, 18086 次搜索 | 92 个单词
| 浏览 | 博客存档
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:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 494 次阅读, 18086 次搜索 | 92 个单词 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
猜您喜欢...
- Daily Interview Puzzle: Intersection of Linked Lists
- [Daily Problem] Validate Balanced Parentheses
- Two-Sum
- Algorithm Interview: No Adjacent Repeating Characters
- Daily Interview Problem: Jump to the End
- Plus One
- Daily Interview Problem: Reverse Words in a String
- Absolute Path
- Daily Interview Problem: Buddy Strings
- Daily Interview Question: Longest Sequence with Two Unique Numbers
©2006~2024 牛排过熟 - 0.0085 秒 - 2322.365 KB/s - 20 在线 内存: 491.97 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。