①leectcode 最短无序子数组: https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/submissions/ 和为k的子数组(两个for循环或使用map记录前缀和) https://leetcode-cn.com/problems/subarray-sum-equals-k/submissions/ 二叉树直径(使用公共变量记录最大直径,然后dfs返回值是depth) https://leetcode-cn.com/problems/diameter-of-binary-tree/submissi...