LeetCode192:House 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.

class Solution {
public:
    int rob(vector<int>& nums) {
        int length=nums.size();
        int *A=new int[length];//A[i] represent the money of rob the room of i and less index.
        int maxMoney=0;
        for(int i=0;i<nums.size();i++)
        {
            A[i]=0;
            for(int j=0;j<i-1;j++)
            {
                if(A[j]>A[i])
                    A[i]=A[j];
            }
            A[i]+=nums[i];
            if(A[i]>maxMoney)
                maxMoney=A[i];
        }
        delete [] A;
        return maxMoney;
    }
};