shaer

摘要： Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文

摘要： Invert a binary tree. Example: Input: Output: Trivia:This problem was inspired by this original tweet by Max Howell: 方法一：递归 时间复杂度：o（n） 空间复杂度：o（1） 阅读全文

摘要： Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path betwe 阅读全文

摘要： 110. Balanced Binary Tree Easy 108994FavoriteShare 110. Balanced Binary Tree Easy 108994FavoriteShare Easy Given a binary tree, determine if it is hei 阅读全文

摘要： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文

摘要： Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the 阅读全文

摘要： Given a singly linked list, determine if it is a palindrome. Example 1: Example 2: 题目要求：以 O(1) 的空间复杂度来求解。 切成两半，把后半段反转，然后比较两半是否相等。 时间复杂度：o（n） 空间复杂度：o（1 阅读全文

摘要： You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contai 阅读全文

摘要： Given a linked list, swap every two adjacent nodes and return its head. You may not modify the values in the list's nodes, only nodes itself may be ch 阅读全文

摘要： Given a linked list, remove the n-th node from the end of list and return its head. Example: Note: Given n will always be valid. 方法一：双指针 删除倒数第n个点，我们首先 阅读全文