198. House Robber

最新推荐文章于 2017-02-28 19:25:17 发布

t_jianyan

最新推荐文章于 2017-02-28 19:25:17 发布

阅读量182

点赞数

分类专栏： leetcode代码笔记

本文链接：https://blog.csdn.net/t_jianyan/article/details/53259833

版权

leetcode代码笔记专栏收录该内容

82 篇文章 0 订阅

订阅专栏

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 x = 0, y = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (i & 1) {
                x = max(x + nums[i], y);
            } else {
                y = max(y + nums[i], x);
            }
        }
        return max(x, y);
    }
};