题解 | #最长上升子序列(一)#

#coding:utf-8
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param nums int整型一维数组 
# @return int整型
#
class Solution:
    def rob(self , nums ):
        def rob_line(nums):
            if not nums:
                return 0
            if len(nums)<3:
                return max(nums)
            mark = [0] * len(nums)
            mark[0]  = nums[0]
            mark[1] = max(nums[:2])
            for i in range(2,len(nums)):
                mark[i] = max(mark[i-1],mark[i-2]+nums[i])
            return mark[-1]
        # write code here
        if not nums:
            return 0
        if len(nums)<=3:
            return max(nums)
        return max(rob_line(nums[:-1]),rob_line(nums[1:]))