최대수익1 [Python-Study Leetcode 문제풀이] 121. Best Time to Buy and Sell Stock (Easy) You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. (Easy) Example 1: Input: prices = [7,1,5,3,6,4] Output: 5 E.. 2021. 3. 14. 이전 1 다음
