mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-03 16:08:02 +00:00
Simplify loop in max profit challenge (#214)
This commit is contained in:
@@ -105,11 +105,9 @@
|
|||||||
" raise TypeError('prices cannot be None')\n",
|
" raise TypeError('prices cannot be None')\n",
|
||||||
" if len(prices) < 2:\n",
|
" if len(prices) < 2:\n",
|
||||||
" raise ValueError('prices must have at least two values')\n",
|
" raise ValueError('prices must have at least two values')\n",
|
||||||
" min_price = prices[0]\n",
|
" min_price = prices.pop(0)\n",
|
||||||
" max_profit = -sys.maxsize\n",
|
" max_profit = prices[0] - min_price\n",
|
||||||
" for index, price in enumerate(prices):\n",
|
" for price in prices:\n",
|
||||||
" if index == 0:\n",
|
|
||||||
" continue\n",
|
|
||||||
" profit = price - min_price\n",
|
" profit = price - min_price\n",
|
||||||
" min_price = min(price, min_price)\n",
|
" min_price = min(price, min_price)\n",
|
||||||
" max_profit = max(profit, max_profit)\n",
|
" max_profit = max(profit, max_profit)\n",
|
||||||
|
|||||||
Reference in New Issue
Block a user