楼兰2021
楼兰2021
全部文章
分类
题解(31)
归档
标签
去牛客网
登录
/
注册
楼兰2021的博客
全部文章
(共30篇)
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-20
2
504
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-19
0
263
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-19
0
290
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-19
0
350
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-19
0
289
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-19
0
285
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-19
0
259
题解 | #排序输出#
# -*- coding:utf-8 -*- class Solution: def findKth(self, a, n, K): # write code here if K>n: return False ...
Python3
2021-09-19
0
214
题解 | #实现二叉树先序,中序和后序遍历#
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...
Python3
2021-09-17
0
403
题解 | #设计LRU缓存结构#
# # lru design # @param operators int整型二维数组 the ops # @param k int整型 the k # @return int整型一维数组 # class Solution: def LRU(self , operators , k ): ...
Python3
2021-09-17
3
453
首页
上一页
1
2
3
下一页
末页