121. Best Time to Buy and Sell Stock
Easy
2881136FavoriteShare
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note that you cannot sell a stock before you buy one.
Example 1:
Input: [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Not 7-1 = 6, as selling price needs to be larger than buying price.
Example 2:
Input: [7,6,4,3,1] Output: 0 Explanation: In this case, no transaction is done, i.e. max profit = 0.
简单dp,一次循环维护最小值和最大值,记得考虑边界和特殊情况。(NULL和<1)
int min(int a,int b){
if(a>=b){
return b;
}else{
return a;
}
}
int max(int a,int b){
if(a>=b){
return a;
}else{
return b;
}
}
int maxProfit(int* prices, int pricesSize){
if(prices==NULL || pricesSize<1){
return 0;
}
int min_p = prices[0];
int max_p = 0;
for(int i=0;i<pricesSize;i++){
min_p = min(min_p, prices[i]);
max_p = max(max_p, prices[i]-min_p);
}
return max_p;
}