#!/usr/bin/env python # -*- coding:utf-8 -*- # Definition for singly-linked list. class ListNode: def __init__(self,

#!/usr/bin/env python # -*- coding:utf-8 -*- # 这题和141题好像都没啥意思 class Solution(object): def detectCycle(self, head):

#!/usr/bin/env python # -*- coding:utf-8 -*- from typing import List class Solution: def maxProfit(self, prices: L

#!/usr/bin/env python # -*- coding:utf-8 -*- from typing import List from functools import lru_cache # 这种递归会导致之前计算号的dp(

#!/usr/bin/env python # -*- coding:utf-8 -*- from utils.util_funcs import TreeNode, Tree # 学到了 # 要明确一点是先序遍历(或后序遍历)和中序遍历出