摘要: 非递归实现,且空间复杂度O(n): class Solution { public void flatten(TreeNode root) { LinkedList<TreeNode> sta=new LinkedList<>(); TreeNode p=root; TreeNode pre=nul 阅读全文
posted @ 2021-06-13 18:16 wsshub 阅读(39) 评论(0) 推荐(0)