Leedcode 算法习题 第七周

198. 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.
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.

题目大意

在一个数组中，找出一个不存在相邻元素的组合，使它的和最大。

我的解答

class Solution {public:    int rob(vector<int>& nums) {        int a = 0;        int b = 0;        for( int i = 0; i < nums.size(); i++){            if(i%2 == 0){//分成奇数下标和偶数下标讨论                a = a+nums[i]>b?a+nums[i]:b;            }            else{                b = b+nums[i]>a?b+nums[i]:a;            }//每次比较原奇数组的和加下一个奇数的和 和偶数和的大小，偶数组同理        }        return a>b?a:b;    }};