#
# @lc app=leetcode.cn id=121 lang=python3
#
# [121] 买卖股票的最佳时机
#

# @lc code=start
class Solution:
    def maxProfit1(self, prices: List[int]) -> int:
        nums = prices
        sub_len = 2
        max_fit = 0
        while sub_len <= len(nums):
            sub_list_id = 0
            for sub_list_id in range(len(nums)-sub_len+1):
                sub_list = list()
                for num,tp_data in enumerate(nums[sub_list_id:]):
                    sub_list.append(tp_data)
                    if (num+1) == sub_len:
                        break
                # Get sub list sum and compare
                tp_vle = sub_list[-1] - sub_list[0]
                if tp_vle > max_fit:
                    max_fit = tp_vle
                sub_list_id = sub_list_id + 1
            sub_len = sub_len + 1
        # max fit post process
        if max_fit < 0:
            max_fit = 0
        return max_fit
# @lc code=end