摘要: 逐行入栈,排序后直接输出第k小的数据 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self. 阅读全文
posted @ 2021-06-24 17:12 泊鸽 阅读(52) 评论(0) 推荐(0)