LeetCode198. 打家劫舍

//198. 打家劫舍
//算是dp吧，f[i]代表：最后一步走到i的答案
//因为不能相邻，f[i]的状态是由f[i-2],f[i-3]来维护
class Solution {
public:
  int rob(vector<int>& s) {
    int n = s.size();
    if (n == 0) return 0;
    if (n == 1) return s[0];
    if (n == 2) return max(s[0], s[1]);
    if (n == 3) return max(s[0] + s[2], s[1]);
    vector<int>f(n + 1, 0);
    f[0] = s[0];
    f[1] = s[1];
    f[2] = s[0] + s[2];
    for (int i = 3; i < n; i++)
      f[i] = max(f[i - 2], f[i - 3]) + s[i];
    return max(f[n - 1], f[n - 2]);
  }
};
//空间优化
class Solution {
public:
  int rob(vector<int>& s) {
    int n = s.size();
    if (n == 0) return 0;
    if (n == 1) return s[0];
    if (n == 2) return max(s[0], s[1]);
    if (n == 3) return max(s[0] + s[2], s[1]);
    int f[3];
    f[0] = s[0];
    f[1] = s[1];
    f[2] = s[0] + s[2];
    for (int i = 3; i < n; i++)
      f[i % 3] = max(f[(i + 1) % 3], f[i % 3]) + s[i];
    return max(f[(n - 1) % 3], f[(n - 2) % 3]);
  }
};