Module Expr Str Assign NameStore Str ClassDef bases body FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Call NameLoad NameLoad If CompareLt NameLoad Num body Return Call NameLoad NameLoad Assign NameStore ListComp Num comprehension NameStore Call NameLoad BinOpAdd BinOpSub NameLoad Num Num For NameStore Call NameLoad Num BinOpAdd NameLoad Num body Assign SubscriptStore NameLoad Index NameLoad Call NameLoad SubscriptLoad NameLoad Index BinOpSub NameLoad Num BinOpAdd SubscriptLoad NameLoad Index BinOpSub NameLoad Num SubscriptLoad NameLoad Index BinOpSub NameLoad Num Assign NameStore SubscriptLoad NameLoad Index Num Assign NameStore ListComp Num comprehension NameStore Call NameLoad BinOpAdd BinOpSub NameLoad Num Num For NameStore Call NameLoad Num BinOpAdd NameLoad Num body Assign SubscriptStore NameLoad Index NameLoad Call NameLoad SubscriptLoad NameLoad Index BinOpSub NameLoad Num BinOpAdd SubscriptLoad NameLoad Index BinOpSub NameLoad Num SubscriptLoad NameLoad Index BinOpSub NameLoad Num Assign NameStore Call NameLoad NameLoad SubscriptLoad NameLoad Index Num Return NameLoad decorator_list decorator_list
N/A N/A 
Note: This is an extension of House Robber.

After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not
get too much attention. This time, all houses at this place are arranged in a circle. That means the first house is the
neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous
street.

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.
 N/A __author__ Daniel Solution N/A N/A rob N/A N/A self nums N/A N/A N/A 
        Two cases: cannot touch 1st element vs. cannot touch 2nd element.
        There are two cases here 1) 1st element is included and last is not included 2) 1st is not included and last is
        included.
        :type nums: list
        :rtype: int
         N/A n N/A len nums N/A N/A n 2 N/A N/A N/A sum nums N/A dp N/A 0 N/A _ N/A xrange N/A N/A n 1 2 N/A i N/A xrange 2 N/A n 1 N/A N/A N/A dp N/A i N/A max N/A dp N/A N/A i 1 N/A N/A dp N/A N/A i 2 N/A nums N/A N/A i 2 N/A ret N/A dp N/A -1 N/A dp N/A 0 N/A _ N/A xrange N/A N/A n 1 2 N/A i N/A xrange 2 N/A n 1 N/A N/A N/A dp N/A i N/A max N/A dp N/A N/A i 1 N/A N/A dp N/A N/A i 2 N/A nums N/A N/A i 1 N/A ret N/A max ret N/A dp N/A -1 N/A ret N/A N/A