LeetCode(198) Horse Robber

题目如下：

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

分析如下：

题目的实质是，给你一堆数，你需要选择其中的部分数出来，使得它们的和最大，但是不能选择相邻的2个或者多个数。

我的代码:

C++ :

/*
status[i] = true;
Input:	[2,1,1,2]
Output:	3
Expected:	4
之前收到max array multiplication的误导，这道题目的思路抽象之后的本质是，一堆数种，要找到不相邻的数所能够构成的最大的和。
*/
// 3ms in C++
class Solution {
public:
    int max(int a , int b) {
        if (a > b) return a;
        else return b;
    }
    int rob(vector<int> &num) {
        if (num.size() == 0) return 0;
        vector<int> max_money(num.size(), 0);
        max_money[0] = num[0];
        max_money[1] = max(max_money[0], max_money[1]);
        for (int i = 1; i < num.size(); ++i) {
            max_money[i] = max(max_money[i - 2] + num[i], max_money[i - 1]);
        }
        return max_money[num.size() - 1];
    }
};

Java:

// 192 ms in Java
public class Solution {
    public int rob(int[] num) {
        if (num.length ==0 ) return 0;
        int[] anArray = new int[num.length];
        anArray[0] = num[0];
        if (num.length < 2) return anArray[0];
        anArray[1] = Math.max(num[0], num[1]);
        for (int i = 2; i < num.length; ++i) {
            anArray[i] = Math.max(anArray[i - 2] + num[i], anArray[i - 1]);    
        }
        return anArray[anArray.length - 1];
    }
}