https://leetcode.com/problems/maximum-width-of-binary-tree/ https://leetcode.com/problems/validate-binary-search-tree/ https://leetcode.com/problems/same-tree/ https://leetcode.com/problems/maximum-depth-of-binary-tree/ https://leetcode.com/problems/construct-binary-tree-from-preorder-and-i...
link:[https://leetcode.com/explore/learn/card/data-structure-tree/134/traverse-a-tree/928/] 递归解法: #Definition for a binary tree node.#class TreeNode(object):#def __init__(self, x):#self.val = x#self.left = None#self.right = NoneclassSolution(object):defsolve(self,root):ifroo...
class Solution { public boolean isSubStructure(TreeNode A, TreeNode B) { LinkedList<TreeNode> queue = new LinkedList<>(); if (A!=null && B==null) return false; if (A!=null) queue.add(A); while (!queue.isEmpty()){ TreeNode tem = queue.removeFirst(); if (isSame(tem, B)) re...
Security Insights Additional navigation options Files 5d90c65 Sign in to see the full file tree. Rocket.md Latest commit Cannot retrieve latest commit at this time. History History File metadata and controls 90.7 KB Raw View raw (Sorry about that, but we can’t show files that are th...
LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解,记录自己的leetcode解题之路。) - niu2niu2niu/leetcode
* struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {} * }; */ class Solution { public: void connect(TreeLinkNode *root) {
Given a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom. Example: Input: [1,2,3,null,5,null,4] Output: [1, 3, 4] Explanation: 1 <---
LeetCode--⼒扣算法整理总结 1、双指针 双指针法是最简单的⼀种了，⼤概就是通过两个变量，作为数组或者字符串的下标索引进⾏操作 双指针⼀共分为三种，分为快慢指针、左右指针、滑动窗⼝ 左右指针⼀般就是while(left<right) ... ⼒扣3题：给定⼀个字符串，请你找出其中不含有重复字符的最长...
TreeNode*left; TreeNode*right; TreeNode(intx) :val(x),left(NULL),right(NULL) {} }; 1. 2. 3. 4. 5. 6. 2、二叉树深度优先遍历递归算法书写 递归算法的三个要素: 1、确定递归函数的参数和返回值 若是在递归过程中需要处理某个参数,就在递归函数里面加上这个参数。
0199 Binary Tree Right Side View Go 54.0% Medium 0200 Number of Islands Go 46.8% Medium 0201 Bitwise AND of Numbers Range Go 39.3% Medium 0202 Happy Number Go 50.4% Easy 0203 Remove Linked List Elements Go 38.6% Easy 0204 Count Primes Go 31.5% Easy 0205 Isomorphic Strings Go 39....