Question

java program to you have an array, A,
for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share
of the stock), design an algorithm to find the maximum profit.
Return the maximum possible profit.​

Answer 1

Answer:

java program to you have an array, A,

for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share

of the stock), design an algorithm to find the maximum profit.

Return the maximum possible profit.