public class Solution {
public int maxProfit(int[] prices) {
if(prices.length==0) return 0;
int max=0,min=prices[0];
for(int i=0;i<prices.length;i++){
if(prices[i]>min){
max=Math.max(max,prices[i]-min);
}else min=prices[i];
}
return max;
}
}
Best Time to Buy and Sell Stock II
public class Solution {
public int maxProfit(int[] prices) {
int total=0;
for(int i=0;i<prices.length-1;i++){
if(prices[i+1]>prices[i]) total+=prices[i+1]-prices[i];
}
return total;
}
}
