[LeetCode] HouseRobber

原创 2015年07月07日 11:29:03

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.

Credits:

Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.

1. DP问题,在每个index i有两个选择:如果抢劫i,则最大收益为(不抢劫i-1)+val[i];如果不抢劫i,则最大收益为(抢劫i-1)

class Solution {
public:
    int rob(vector<int>& nums) {
        int rob_true=0;
        int rob_false=0;
        for(auto val: nums)
        {
            int tmp=rob_true;
            //if rob this house, definitely cannot rob the previous house
            rob_true = rob_false + val;
            //if not rob this house, either rob or skip the previous house
            rob_false = max(tmp,rob_false);
        }
        return max(rob_true, rob_false);
    }
};


2. 递归的思路,超时!!!!!

class Solution {
public:
    void helper(vector<int>& nums, int start, int end, int& maxval, int tmpsum)
    {
        if(start>end) return;
        if(start==end){
            tmpsum+=nums[start];
            if(maxval<tmpsum) maxval=tmpsum;
            return;
        }
        //recursively call helper for conditions: (1) if nums[start] is picked;
        //(2) nums[start] is not picked
        helper(nums,start+2,end,maxval,tmpsum+nums[start]);
        helper(nums,start+1,end,maxval,tmpsum); //nums[start] is not picked
    }
    int rob(vector<int>& nums) {
        int maxval=0, tmpsum=0;
        helper(nums,0,nums.size()-1,maxval, tmpsum);
        return maxval;
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

LeetCode | HouseRobber 算法题

题目: You are a professional robber planning to rob houses along a street. Each house has a certain a...

leetcode(198)(213) HouseRobber HouseRobber-II

原题链接: https://leetcode.com/problems/house-robber/ https://leetcode.com/problems/house-robber-ii/...

HouseRobber(即求一串数中不连续的数之和中最大的)

You are a professional robber planning to rob houses along a street. Each house has a certain amount...

leetcode 149题汇总

  • 2017-09-14 14:33
  • 153KB
  • 下载

LeetCode Patching Array

  • 2016-04-17 18:06
  • 452B
  • 下载

LeetCode - Two Sum

Question: Given an array of integers, return indices of the two numbers such that they add up to a...

leetcode-tag-Stack

  • 2017-04-29 23:05
  • 36KB
  • 下载

Leetcode 32. Longest Valid Parentheses

问题描述 Given a string containing just the characters '(' and ')', find the length of the longe...

Leetcode 题解

  • 2016-09-05 15:01
  • 837KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)