lothar.buchholz/buy-and-sell-twice
0
0
Fork 1
forked from code-clash/buy-and-sell-twice
Code Issues Pull Requests Releases Wiki Activity

Added description and testdata

Browse Source
This commit is contained in:
Christoph Prybila
2020-04-02 00:36:22 +02:00
parent fe0587f91c
commit c86c1ba120
4 changed files with 52 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
README.md
View File

@@ -0,0 +1,33 @@
# Buy and Sell Twice
## Goal
Given is the price-development of an arbitrary stock.
![stock-price over time](doc/stock-price.JPG)
Suppose you have perfect knowledge and are able to buy and sell the stock **twice**.
Write an algorithm that outputs the maximum profit that can be made.
* The price-development is given for an arbitrary number of days.
* A stock can only be sold on the next day.
* Stock-prices are given as integers
* **The second buy must be made on another date after the first sale**
### Input
A blank-separated array of stock-prices.
Each position symbolises the stock-price of a given day.
### Output
The maximum profit that can be made within that day.
### Constraints
* 4 <= `days with stock-prices` <= 50
* 1 <= `stock-price` <= 2,147,483,647
### Example
**Input:**
`12 11 13 9 12 8 14 13 15`
**Output:**
`10`