(Array)121. Best Time to Buy and Sell Stock
2024-04-10 02:15:13
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.
public class Solution {
public int maxProfit(int[] prices) {
if(prices.length<2) return 0;
int res=prices[1]-prices[0]; //开始是想用定义一个新的数组的，写到一半发现只要2个变量就好了
int curmin=(res<0?prices[1]:prices[0]);
for(int i=2;i<prices.length;i++){
res=Math.max(res,prices[i]-curmin);
curmin=Math.min(prices[i],curmin);
}
return (res>0)?res:0; //注意返回值肯定不是负数
}
}
最新文章
- 【Java EE 学习 25 上】【网上图书商城项目实战】
- Atitit 作用域的理解attilax总结
- plsql修改表报错：ORA-25150
- mysql中Access denied for user 'root'@'localhost' (using password:YES)
- Android--图片集
- CareerCup: 17.14 minimize unrecognized characters
- 磁盘参数修订[转自vbird]
- Ajax风格的一款网页Loading效果
- Java String.contains()方法（转载）
- Android中Application类用法
- [Python学习笔记][第七章Python文件操作]
- 【BZOJ 1088 扫雷Mine】模拟
- struts2 全局格式化，格式化时间，金钱，数字
- stm32之CAN发送、接收详解
- 前端知识点一HTML相关知识点
- nginx的负载均衡集群测试
- linux重新设置密码，亲试成功
- PHP FastCGI进程管理器PHP-FPM的架构
- FileInputStream类与FileOutputStream类
- 个人开源项目之异步Http线程池框架