Best Time to Buy and Sell Stock

最新推荐文章于 2022-07-29 20:36:59 发布

uj_mosquito

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量469

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/uj_mosquito/article/details/42390521

版权

LeetCode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Say you have an array for which the i^th 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.

#include<stdio.h>

int maxProfit(int *prices, int n) {
    int i = 0;
    int profit = 0, min = prices[0];
    if(n == 0) return 0;

    for(i = 1; i < n; i++){
        if(prices[i] - min > profit) profit = prices[i] - min;
        if(prices[i] < min) min = prices[i];
    }
    return profit;
}

void main() {
    int prices[] = {7,6,5,4,3,2,1,0};
    int n = 8;
    printf("%d\n", maxProfit(prices, n));

}