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

LeetCode Best Time to Buy and Sell Stock

时间:2014-10-18 22:14:23      阅读:151      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   color   io   os   ar   for   sp   

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.

 

 1 public class Solution {
 2     public int maxProfit(int[] prices) {
 3         if (prices.length<=1) {
 4             return 0;
 5         }
 6         
 7         int minPrice=prices[0];
 8         int profit=0;
 9         for (int i = 1; i < prices.length; i++) {
10             if ((prices[i]-minPrice)>profit) {
11                 profit=prices[i]-minPrice;
12             }
13             if (prices[i]<minPrice) {
14                 minPrice=prices[i];
15             }
16         }
17         
18         return profit;
19     }
20 }

 

LeetCode Best Time to Buy and Sell Stock

标签:des   style   blog   color   io   os   ar   for   sp   

原文地址:http://www.cnblogs.com/birdhack/p/4033658.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!