【动态规划】按摩师

题目链接https://leetcode.cn/problems/the-masseuse-lcci/classSolution{public:intmassage(vectorintnums){/*时空复杂度O(n)*/intnnums.size();// 处理边界情况if(n0)return0;// 1. 创建dp表vectorintf(n);//vectorint g(n);autogf;// 2. 初始化f[0]nums[0];// 3. 填表for(inti1;in;i){f[i]g[i-1]nums[i];g[i]max(f[i-1],g[i-1]);}// 4. 返回值returnmax(f[n-1],g[n-1]);}};