题解 | [Galadriel]#牛群的夜间保卫##C++#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param values int整型vector 
     * @return int整型
     */
  //this solution is for C++
  //use the dp method
    int maxPatrolValue(vector<int>& values) {
        // write code here
        vector<int> dp(values.size());	//create DP vector
        dp[0]=values[0];	//deal with the first value
        if(values.size()==1)    return dp[0];	//if there's only one cow
        dp[1] = max(values[0],values[1]);	//initialize the second value
        for(int i=2;i<values.size();i++){
            dp[i] = max(dp[i-1],dp[i-2]+values[i]);		//the dp loop
        }
        return dp[values.size()-1];		//the last one is the largest
    }
};