LeetCode: Best Time to Buy and Sell Stock

一次过

 1 class Solution {

 2 public:

 3     int maxProfit(vector<int> &prices) {

 4         // Start typing your C/C++ solution below

 5         // DO NOT write int main() function

 6         if (prices.size() <= 1) return 0;

 7         int minprice = prices[0];

 8         int maxprofit = 0;

 9         for (int i = 1; i < prices.size(); i++) {

10             minprice = min(minprice, prices[i]);

11             maxprofit = max(maxprofit, prices[i]-minprice);

12         }

13         return maxprofit;

14     }

15 };

 C#版:

 1 public class Solution {

 2     public int MaxProfit(int[] prices) {

 3         int maxProfit = 0;

 4         if (prices.Count() < 1) return 0;

 5         int minPrice = prices[0];

 6         for (int i = 1; i < prices.Count(); i++) {

 7             maxProfit = Math.Max(maxProfit, prices[i] - minPrice);

 8             minPrice = Math.Min(minPrice, prices[i]);

 9         }

10         return maxProfit;

11     }

12 }
View Code

 

你可能感兴趣的:(LeetCode)