牛客624491422号

分类

题解(99)

/ 注册

全部文章（共29篇）

题解 | #缺失的第一个正整数#

迭代可以通过，递归不能通过 #coding:utf-8 # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param nums int整型一维数组 # @return int整型 # class Solution: def minNumber...

Python2

2022-03-14

0 305

题解 | #数组中只出现一次的两个数字#

# # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param array int整型一维数组 # @return int整型一维数组 # class Solution: def FindNumsAppearOnce(self , array ...

Python2

2022-03-14

0 283

题解 | #二叉搜索树与双向链表#

# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None cl...

Python2

2022-03-11

0 263

题解 | #判断是不是二叉搜索树#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

Python2

2022-03-11

0 262

题解 | #二叉树的镜像#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

Python2

2022-03-09

0 211

题解 | #合并二叉树#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param t1 TreeNod...

Python2

2022-03-09

0 247

题解 | #对称的二叉树#

# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None cl...

Python2

2022-03-09

0 230

题解 | #二叉树中和为某一值的路径(一)#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...

Python2

2022-03-09

0 215

题解 | #旋转数组的最小数字#

# -*- coding:utf-8 -*- class Solution: def minNumberInRotateArray(self, rotateArray): # write code here if not rotateArray : ...

Python2

2022-03-09

0 352