LintCode(M)打劫房屋（动态规划）

最初代码：

class Solution {
public:
    /**
     * @param A: An array of non-negative integers.
     * return: The maximum amount of money you can rob tonight
     */
   long long houseRobber(vector<int> A) {
    // write your code here
    // int n = A.size();
    vector<long long> a(A.size(),0);
    if (A[1]>A[0] ) { a[0] = 0; a[1] = A[1]; }
    else { a[0] = A[0]; a[1] = 0; }
    if (A.size() == 1) return A[0];
    if (A.size() == 2) return max(A[0],A[1]);
    for (int i = 2; i<A.size(); ++i){
        a[i] = max(a[i - 2] + A[i], a[i - 1]);
    }
    return a[A.size() - 1];
}
};

运行结果：
e
二次修改：

 long long houseRobber(vector<int> A) {
    // write your code here
    // int n = A.size();
    vector<long long> a(A.size(),0);
int temp1,temp2;
    if (A.size() == 1) return A[0];
    if (A.size() == 2) return max(A[0],A[1]);
    a[0] = 0; a[1] = A[1]; 

    for (int i = 2; i<A.size(); ++i){
        a[i] = max(a[i - 2] + A[i], a[i - 1]);
    }
    temp1=a[A.size()-1];
    a[0] = A[0]; a[1] = 0;
    for (int i = 2; i<A.size(); ++i){
        a[i] = max(a[i - 2] + A[i], a[i - 1]);
    }
    temp2=a[A.size()-1];
    return max(temp1,temp2);
    }

这次修改主要在于弄清a[0]和a[1]都有两种可能性，不能择大而取值。
但是结果依然有误：

但很快查明错误在哪：temp1和temp2是int型，而不是long long 型。
将这一点改正后就成功了。
在做打劫房屋2时，发现我这个通过lintcode打劫房屋1的代码居然有错，详见打劫房屋2的blog,以下为修改后的代码：

class Solution {
public:
    /**
     * @param nums: An array of non-negative integers.
     * return: The maximum amount of money you can rob tonight
     */
 long long houseRobber(vector<int> A) {
    // write your code here
    // int n = A.size();
    vector<long long> a(A.size(), 0);
    long long temp1, temp2;
    if (A.size() == 1) return A[0];
    if (A.size() == 2) return max(A[0], A[1]);
    /*a[0] = 0; a[1] = A[1];

    for (int i = 2; i<A.size(); ++i){
        a[i] = max(a[i - 2] + A[i], a[i - 1]);
    }
    temp1 = a[A.size() - 1];
    a[0] = A[0]; a[1] = 0;*/
    a[0] = A[0]; a[1] = max(A[0], A[1]);
    for (int i = 2; i<A.size(); ++i){
        a[i] = max(a[i - 2] + A[i], a[i - 1]);
    }
    temp2 = a[A.size() - 1];
    return temp2;
    //return max(temp1, temp2);

}


};