diff options
author | William Carroll <wpcarro@gmail.com> | 2020-02-27T15·37+0000 |
---|---|---|
committer | William Carroll <wpcarro@gmail.com> | 2020-03-01T22·32+0000 |
commit | 4d2d19f13688504cc6bbc8804cf186acb4e78a4e (patch) | |
tree | 0e14e3f30e6a17761a0b8e0814060f4476074aa9 /scratch/deepmind/part_two/stock-price.py | |
parent | 3abee3373c3e57273404ba1f0c197083b0ea64bc (diff) |
Solve InterviewCake's stock-price problem
Write a function that returns the maximum profit that a trader could have made in a day. I solved this using a greedy algorithm which constantly sets the maximum profit by tracking the lowest price we've encountered.
Diffstat (limited to 'scratch/deepmind/part_two/stock-price.py')
-rw-r--r-- | scratch/deepmind/part_two/stock-price.py | 54 |
1 files changed, 54 insertions, 0 deletions
diff --git a/scratch/deepmind/part_two/stock-price.py b/scratch/deepmind/part_two/stock-price.py new file mode 100644 index 000000000000..56a3c20ea05b --- /dev/null +++ b/scratch/deepmind/part_two/stock-price.py @@ -0,0 +1,54 @@ +import unittest + + +def get_max_profit(xs): + if len(xs) < 2: + raise Exception('Can only trade with two or more ticker values.') + lowest_buy = xs[0] + max_profit = None + for x in xs[1:]: + if not max_profit: + max_profit = x - lowest_buy + else: + max_profit = max(max_profit, x - lowest_buy) + lowest_buy = min(lowest_buy, x) + return max_profit + + +# Tests +class Test(unittest.TestCase): + def test_price_goes_up_then_down(self): + actual = get_max_profit([1, 5, 3, 2]) + expected = 4 + self.assertEqual(actual, expected) + + def test_price_goes_down_then_up(self): + actual = get_max_profit([7, 2, 8, 9]) + expected = 7 + self.assertEqual(actual, expected) + + def test_price_goes_up_all_day(self): + actual = get_max_profit([1, 6, 7, 9]) + expected = 8 + self.assertEqual(actual, expected) + + def test_price_goes_down_all_day(self): + actual = get_max_profit([9, 7, 4, 1]) + expected = -2 + self.assertEqual(actual, expected) + + def test_price_stays_the_same_all_day(self): + actual = get_max_profit([1, 1, 1, 1]) + expected = 0 + self.assertEqual(actual, expected) + + def test_error_with_empty_prices(self): + with self.assertRaises(Exception): + get_max_profit([]) + + def test_error_with_one_price(self): + with self.assertRaises(Exception): + get_max_profit([1]) + + +unittest.main(verbosity=2) |