码迷,mamicode.com
首页 > 其他好文 > 详细

121.买卖股票 Best Time to Buy and Sell Stock

时间:2017-01-10 23:50:23      阅读:69      评论:0      收藏:0      [点我收藏+]

标签:add   top   companies   one   text   pos   lang   new   cti   

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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Example 1:

Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 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

In this case, no transaction is done, i.e. max profit = 0.

Subscribe to see which companies asked this question

思路:动态规划
  1. public class Solution {
  2. public int MaxProfit(int[] prices) {
  3. if (prices.Length == 0)
  4. {
  5. return 0;
  6. }
  7. int low = prices[0];
  8. int max = 0;
  9. int length = prices.Length;
  10. for (int i = 0; i < length; i++)
  11. {
  12. if (prices[i] < low)
  13. {
  14. low = prices[i];
  15. }
  16. else if (prices[i] - low > max)
  17. {
  18. max = prices[i] - low;
  19. }
  20. }
  21. return max;
  22. }
  23. }





121.买卖股票 Best Time to Buy and Sell Stock

标签:add   top   companies   one   text   pos   lang   new   cti   

(0)
(0)
   
举报
评论 一句话评论(0
0条  
登录后才能评论!
© 2014 mamicode.com 版权所有 京ICP备13008772号-2
迷上了代码!