\"[google面试题]If you were only permitted to buy one share of the stock and sell one share of the stock, design an algorithm to find the best times to buy and sell.\"

Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to buy one share of the stock and sell one share of the stock,design an algorithm to find the best times to buy and sell.Good answer:Go through the array in order,keeping track of the lowest stock priceand the best deal you've seen so far.Whenever the current stock price minus thecurrent lowest stock price is better than the current best deal,update the best deal to this new value.