← 返回 cisco 的题目列表House Robber Problem
类型:online_judge
House Robber Problem: You are given an array representing the amount of money of each house, determine the maximum amount of money you can rob without robbing two adjacent houses.
Example
Input
1 2 3 1