2022-10-08

[github-actions]

No description provided.

[Akiq2016]

/*
 * @lc app=leetcode.cn id=121 lang=java
 *
 * [121] 买卖股票的最佳时机
 */

// @lc code=start
class Solution {
    public int maxProfit(int[] prices) {
        int minPrice = prices[0];
        int result = 0;

        for (int price : prices) {
            minPrice = Math.min(minPrice, price);
            result = Math.max(result, price - minPrice);
        }

        return result;
    }
}
// @lc code=end

---

Nickname: Aki
From vscode-hzfe-algorithms