qq_42991793的博客

顺序表操作code存放在h头文件中，调用即可#include<iostream>const int MAXSIZE=100;using namespace std;//定义顺序表结构typedef struct{ //define structure int *a; int len; int listsize;}List;void I...

LeetCode141. 环形链表(快慢指针)快慢指针参考https://zhuanlan.zhihu.com/p/30990994?utm_source=qq&utm_medium=social&utm_oi=1080275092017270784# Definition for singly-linked list.class ListNode(object): ...

LeetCode112.路径总和version 1# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution: ...

LeetCode104.二叉树的最大深度 (BFS)+(递归)两种方法BFS# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None ...

LeetCode111. 二叉树的最小深度 (BFS) + (递归)两种方法BFS# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None ...

LeetCode513 找树左下角的值(BFS)BFS算法层层遍历，记录每层的最左边的结点的值# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = No...

Python实现二叉树（4种遍历，含层序遍历）codeclass TreeNode(object): def __init__(self, data=None, left=None, right=None): self.data = data self.left = left self.right = rightclass Bi...

LeetCode101. 对称二叉树 (递归) + (迭代)递归class Solution: def isSymmetric(self, root): """ :type root: TreeNode :rtype: bool """ if root: return sel...

LeetCode104 二叉树的最大深度（DFS）DFS递归# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solutio...

Python 实现二叉搜索树(Binary Search Tree)and c++实现Pythonimport numpy as npclass Node(object): def __init__(self, data= None, lchild=None, rchild=None, parent=None): self.key = data ...

单向链表相关函数代码整理笔记code#include<iostream>#include<cstdlib>using namespace std;typedef struct LNode{ int data; struct LNode *next;}LNode,*LinkList;void CreateLink(LinkLi...

快慢指针参考https://zhuanlan.zhihu.com/p/30990994?utm_source=qq&utm_medium=social&utm_oi=1080275092017270784# Definition for singly-linked list.class ListNode(object): def __init__(self, x):...