leetcode 714
题目 例子 思路1
使用dp[n][2] 存储最佳利润值,动态规划的思路,重要的是转移方程。
代码1
class Solution { public: int maxProfit(vector& prices, int fee) { int n prices.size(); //dp[i][0] 前i天手里没有股票的最大利润 //…
录音 Facebook 2 Retelling|Facebook2 复述转写
Hi, Im Helen Campbell, from DJ interpretation, European Commission, Im going to talk about Facebook. You Im sure that you are more familiar with Facebook, a lot, a lot more familiar than I than me. But Ive read…