【LeeCode】 Best Time to Buy and Sell Stock

Best Time to Buy and Sell Stock

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.

（1）Violence and Enumeration Method

 public int maxProfit(int[] prices) {
        if(prices == null || prices.length == 0)
            return 0;
        int profit = 0;
        for(int i=0;i<prices.length;i++){
            for(int j=i+1;j<prices.length;j++){
                profit = Math.max(profit, prices[j] - prices[i]);
            }
        }
        return profit;
 }

（2）Transform , then calculate the maximum of sub sequence

public int maxProfit(int[] prices){
   if(prices == null || prices.length == 0)
      return 0;
   int n = prices.length - 1;
   int[] profits = new int[n];
   for(int i=0;i<n;i++){
      profits[i] = prices[i+1] - prices[i];
   }
   return  continuousSerialMaxSum(profits);
}

pubic int continuousSerialMaxSum(int[] A){
   int curr_sum = 0;
   int max_sum = 0;
   for(int i=0;i<A.length;i++){
      curr_sum += A[i];
      if(curr_sum > max_sum){
         max_sum = curr_sum;
      }else if(curr_sum < 0){
         curr_sum = 0;
      }
   }
   return max_sum;
}