leetcode 买卖股票问题

leetcode121 Best Time to Buy and Sell Stock

说白了找到最大的两组数之差即可

 class Solution {
 public:
     int maxProfit(vector<int>& prices) {
         int m = ;
         for(int i = ; i < prices.size(); i++){
             for(int j = i + ; j < prices.size(); j++){
                 m = max(m, prices[j] - prices[i]);
             }
         }
         return m;
     }
 };

leetcode122 Best Time to Buy and Sell Stock II

关键在于明白股票可以当天卖出再买进

 class Solution {
 public:
     int maxProfit(vector<int>& prices) {
         if(prices.size() == ) return ;
         int m = ;
         for(int i = ; i < prices.size() - ; i++){
             if(prices[i] < prices[i + ]){
                 m += prices[i + ] - prices[i];
             }
         }

         return m;
     }
 };