题解 | #最长递增子序列#
买卖股票的最好时机
http://www.nowcoder.com/practice/64b4262d4e6d4f6181cd45446a5821ec
/**
*
* @param prices int整型一维数组
* @return int整型
*/
function maxProfit( prices ) {
// write code here
// 一次遍历
let max = 0;
let minPrice = 2e9;
for (let i=0; i<prices.length; i++) {
const profit = prices[i] - minPrice;
max = profit > max ? profit : max;
minPrice = prices[i] < minPrice ? prices[i] : minPrice;
}
return max;
}
module.exports = {
maxProfit : maxProfit
}; 
查看8道真题和解析
