ๆๆจ่ฟไธช้ข๏ผ่ฟ็่ณไธๆฏ็็dpๅง๏ผไธ็ฅ้ๅจ่ไปไน
class Solution { public int maxProfit(int[] prices) { int maxP = 0; for (int i = 1; i < prices.length; i++) { maxP += Math.max(0, prices[i] - prices[i-1]); } return maxP; } }
Last updated 9 months ago