Given the above assertions we derive the following answer using Python. element pertains to the index of the array, using the power of hindsight it is possible to compare the index of array iterations to see if you should have purchased or held your money based on stock value. The rest of the description is a Red Herring.Ģ. The last line of the question suggest the answer should be given in terms of a cumulative unit value. If no profit can be made, then the answer should be 0ġ. In other words, you must sell the stock before you buy it again. Note that you cannot engage in multiple transactions at once. A transaction is defined as buying, and then selling one share of the stock.
You are given the following array of stock prices (which are numbers) where the i-th element represents the stock price on day i: 9,151,169,35,194,68,19,148,29,97,12,29 Determine the maximum possible profit you can earn using as many transactions as you'd like. You have 10 tries remaining, after which the contract will self-destruct. Algorithmic Stock Trader II You are attempting to solve a Coding Contract.
0 kommentar(er)
