1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

class Solution {
public:
    int robOne(vector& nums) {
        if (nums.size() == 0) {
            return 0;
        }
        vector v(nums.size() + 1);
        v[0] = 0;
        v[1] = nums[0];
        for (int i = 1; i < nums.size(); i++) {
            int j = i + 1;
            if (nums[i] + v[j - 2] > v[j - 1]) {
                v[j] = nums[i] + v[j - 2];
            } else {
                v[j] = v[j - 1];
            }
        }
        return v[nums.size()];
    }

    int rob(vector& nums) {
        vector numsc;
        int size = nums.size();
        int sum = 0;
        for (int i = 0; i < size; i++) {
            numsc.clear();
            int tmp = nums[i];
            for (int j = i; j < size; j++) {
                if (j == ((i-1) < 0 ? i - 1 + size : i - 1) || 
                    j == ((i+1) >= size ? i + 1 - size : i + 1) || 
                    j == i) {
                    numsc.push_back(0);
                    continue;
                }
                numsc.push_back(nums[j]);
            }
            for (int j = 0; j < i; j++) {
                if (j == ((i-1) < 0 ? i - 1 + size : i - 1) || 
                    j == ((i+1) >= size ? i + 1 - size : i + 1) || 
                    j == i) {
                    numsc.push_back(0);
                    continue;
                }
                numsc.push_back(nums[j]);
            }
            tmp += robOne(numsc);
            if (tmp >= sum) {
                sum = tmp;
            }
        }
        return sum;
    }
};