サンダーボルト

相手モンスターを全て破壊する。

2019-04-11から1日間の記事一覧

LeetCode Study : 121. Best Time to Buy and Sell Stock

問題 Say you have an array for which the element is the price of a given stock on day . If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum…