Best Time To Buy and Sell Stocks/solution c.c
/*
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.

From Leetcode : https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
*/
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.


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 .
int maxProfit(int* prices, int pricesSize){
    int min_price = INT_MAX;
    int max_profit = 0;
    for (int i = 0; i < pricesSize; i++) {
        if (prices[i] < min_price) {
            min_price = prices[i];
        }
        int profit = prices[i] - min_price;
        if (profit > max_profit) {
            max_profit = profit;
        }
    }
    return max_profit;
}
int maxProfit ( int * prices , int pricesSize ) { int min_price = INT_MAX ; int max_profit = 0 ; for ( int i = 0 ; i < pricesSize ; i ++ ) { if ( prices [ i ] < min_price ) { min_price = prices [ i ] ; } int profit = prices [ i ] - min_price ; if ( profit > max_profit ) { max_profit = profit ; } } return max_profit ; }
You are given an array prices where prices[i] is the price of a given stock on the ith day.
You are given an array prices where prices [ i ] is the price of a given stock on the ith day .