【leetcode】【easy】【每日一题】面试题 17.16. The Masseuse LCCI

最新推荐文章于 2020-10-28 01:16:13 发布

lemonade13

最新推荐文章于 2020-10-28 01:16:13 发布

阅读量321

点赞数

分类专栏： code c++

本文链接：https://blog.csdn.net/lemonade13/article/details/105083239

版权

code 同时被 2 个专栏收录

233 篇文章 0 订阅

订阅专栏

c++

230 篇文章 0 订阅

订阅专栏

面试题 17.16. The Masseuse LCCI

A popular masseuse receives a sequence of back-to-back appointment requests and is debating which ones to accept. She needs a break between appointments and therefore she cannot accept any adjacent requests. Given a sequence of back-to-back appoint ment requests, find the optimal (highest total booked minutes) set the masseuse can honor. Return the number of minutes.

Note: This problem is slightly different from the original one in the book.

Example 1:

Input:  [1,2,3,1]
Output:  4
Explanation:  Accept request 1 and 3, total minutes = 1 + 3 = 4

Example 2:

Input:  [2,7,9,3,1]
Output:  12
Explanation:  Accept request 1, 3 and 5, total minutes = 2 + 9 + 1 = 12

Example 3:

Input:  [2,1,4,5,3,1,1,3]
Output:  12
Explanation:  Accept request 1, 3, 5 and 8, total minutes = 2 + 4 + 3 + 3 = 12

题目链接：https://leetcode-cn.com/problems/the-masseuse-lcci/

思路

和匪徒问题一个思路，对当前值取和不取两个值的dp。

class Solution {
public:
    int massage(vector<int>& nums) {
        int len = nums.size();
        if(len==0) return 0;
        if( len==1) return nums[0];
        int no = 0, yes = nums[0];
        for(int i=1; i<len; ++i){
            int no_tmp = max(yes, no);
            yes = no+nums[i];
            no = no_tmp;
        }
        return max(yes,no);
    }
};