mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-14 13:28:03 +00:00
Add k max profit challenge
This commit is contained in:
45
recursion_dynamic/max_profit_k/test_max_profit.py
Normal file
45
recursion_dynamic/max_profit_k/test_max_profit.py
Normal file
@@ -0,0 +1,45 @@
|
||||
from nose.tools import assert_equal
|
||||
from nose.tools import assert_raises
|
||||
from nose.tools import assert_true
|
||||
|
||||
|
||||
class TestMaxProfit(object):
|
||||
|
||||
def test_max_profit(self):
|
||||
stock_trader = StockTrader()
|
||||
assert_raises(TypeError, stock_trader.find_max_profit, None, None)
|
||||
assert_equal(stock_trader.find_max_profit(prices=[], k=0), [])
|
||||
prices = [5, 4, 3, 2, 1]
|
||||
k = 3
|
||||
assert_equal(stock_trader.find_max_profit(prices, k), (0, []))
|
||||
prices = [2, 5, 7, 1, 4, 3, 1, 3]
|
||||
profit, transactions = stock_trader.find_max_profit(prices, k)
|
||||
assert_equal(profit, 10)
|
||||
assert_true(Transaction(Type.SELL,
|
||||
day=7,
|
||||
price=3) in transactions)
|
||||
assert_true(Transaction(Type.BUY,
|
||||
day=6,
|
||||
price=1) in transactions)
|
||||
assert_true(Transaction(Type.SELL,
|
||||
day=4,
|
||||
price=4) in transactions)
|
||||
assert_true(Transaction(Type.BUY,
|
||||
day=3,
|
||||
price=1) in transactions)
|
||||
assert_true(Transaction(Type.SELL,
|
||||
day=2,
|
||||
price=7) in transactions)
|
||||
assert_true(Transaction(Type.BUY,
|
||||
day=0,
|
||||
price=2) in transactions)
|
||||
print('Success: test_max_profit')
|
||||
|
||||
|
||||
def main():
|
||||
test = TestMaxProfit()
|
||||
test.test_max_profit()
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
main()
|
||||
Reference in New Issue
Block a user