首页 > 其他 > 详细

Leetcode: Best Time to Buy and Sell Stock

时间:2014-05-29 20:44:03      阅读:390      评论:0      收藏:0      [点我收藏+]

My original thought was to calculate all the possible transactions by using nested loop.  But got time limit excess error.

I knew it can be done in O(n), but I could not figure it out by myself, so I checked the solutions that were available in Internet.  

bubuko.com,布布扣
 1 public class Solution {
 2     public int maxProfit(int[] prices) {
 3         int profit = 0;
 4         int min = Integer.MAX_VALUE;
 5         if (prices.length == 0) return profit;
 6         for (int current : prices) {
 7             if (current < min) {
 8                 min = current;
 9             }
10             if (profit < current-min) {
11                 profit = current - min;
12             }
13         }
14         return profit;
15     }
16 }
bubuko.com,布布扣

 

 

Leetcode: Best Time to Buy and Sell Stock,布布扣,bubuko.com

Leetcode: Best Time to Buy and Sell Stock

原文:http://www.cnblogs.com/EdwardLiu/p/3758233.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!