You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
||3 years ago|
|.idea||3 years ago|
|doc||3 years ago|
|gradle/wrapper||3 years ago|
|src||3 years ago|
|.gitignore||3 years ago|
|README.md||3 years ago|
|build.gradle||3 years ago|
|gradlew||3 years ago|
|gradlew.bat||3 years ago|
|settings.gradle||3 years ago|
Buy and Sell Once
Given is the price-development of an arbitrary stock.
Suppose you have perfect knowledge and are able to buy and sell the stock once. 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
A blank-separated array of stock-prices.
Each position symbolises the stock-price of a given day.
The maximum profit that can be made within that day.
- 2 <=
days with stock-prices<= 50
- 1 <=
310 315 275 295 260 270 290 230 255 250