https://leetcode-cn.com/problems/the-masseuse-lcci/

阅读前两个提示之后尝试递归解决

测试用例:[104,209,137,52,158,67,213,86,141,110,151,127,238,147,169,138,240,185,246,225,147,203,83,83,131,227,54,78,165,180,214,151,111,161,233,147,124,143]

```

/**

 * @param {number[]} nums

 * @return {number}

 */

var massage = function(nums) {

 if(nums.length === 0){

  return 0

 }

 let selectTotal = massage(nums.slice(2)) + nums[0];

 let unselectTotal = massage(nums.slice(1))

 return Math.max(selectTotal, unselectTotal)

};

```

执行用时:8372ms

思考后改良为操作index减少时间及内存开销

```

var massage = function(nums) {

  let maxIndex = nums.length - 1;

  function resolve(index){

    if(index > maxIndex){

     return 0

    }

    let selectTotal = resolve(index + 2) + nums[index];

    let unselectTotal = resolve(index + 1)

    return Math.max(selectTotal, unselectTotal)

  }

  return resolve(0)

};

```

此时时间减少为1224毫秒

提交仍然显示超时

能给我一些提示让他符合时间限制吗(约为200ms以内)