- 博客(6)
- 收藏
- 关注
RSS订阅原创 队列239、滑动窗口的最大值
题目 C#代码 public class Solution { public int[] MaxSlidingWindow(int[] nums, int k) { MyCircularDeque deque=new MyCircularDeque(k); int[] result = new int[nums.Length-k+1]; int j = 0; for (i
2020-07-01 11:26:03
150
原创 图210、课程表Ⅱ
题目 C#代码 public class Solution { public int[] FindOrder(int numCourses, int[][] prerequisites) { int[] res = new int[numCourses]; LinkedList<int>[] list = new LinkedList<int>[numCourses]; for (int i = 0;
2020-07-01 11:16:36
4834
原创 图207、课程表
题目 C#代码 public class Solution { public bool CanFinish(int numCourses, int[][] prerequisites) { LinkedList<int>[] list = new LinkedList<int>[numCourses]; for (int i = 0; i < list.Length; i++) {
2020-07-01 11:08:51
176
原创 二叉树236、二叉树的最近公共祖先
题目 C#代码 /** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNode(int x) { val = x; } * } */ public class Solution { public TreeNode
2020-07-01 10:56:23
107
原创 二叉树104、二叉树的最大深度
题目 C#代码 /** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNode(int x) { val = x; } * } */ public class Solution { public int MaxDe
2020-07-01 00:40:08
77
原创 二叉树101、对称二叉树
题目 C#代码 /** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNode(int x) { val = x; } * } */ public class Solution { public bool IsSy
2020-07-01 00:34:50
71
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人