标签：des blog io os ar java for sp div
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.
c++版本：
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) {
return 0;
}
int min = prices[0], profit = 0;
for(int i = 0; i < prices.size(); i++) {
min = prices[i] < min ? prices[i] : min;
profit = (prices[i] - min) > profit ? (prices[i] - min) : profit;
}
return profit;
}
};
Java版本：
public class Solution {
public int maxProfit(int[] prices) {
if(prices==null||prices.length<=1){
return 0;
}
int min = prices[0];
int profit = 0;
for(int i = 0; i < prices.length; i++) {
min = prices[i] < min ? prices[i] : min;
profit = (prices[i] - min) > profit ? (prices[i] - min) : profit;
}
return profit;
}
}
Best Time to Buy and Sell Stock
标签：des blog io os ar java for sp div
原文地址：http://www.cnblogs.com/zlz-ling/p/4044256.html
