IfUwanna IT

[LeetCode] 121. Best Time to Buy and Sell Stock - 문제풀이

Description 주어진 일자별 주식 가격이 기재된 배열에서 가장 큰 이익을 남길 수 있는 경우의 수를 계산하여 반환하는 문제입니다. 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 ..