题目地址：https://leetcode-cn.com/probl…题目描述：给定一个二叉树，编写一个函数来获取这个树的最大宽度。树的宽度是所有层中的最大宽度。这个二叉树与满二叉树（full binary …

  We are given N different types of stickers. Each sticker has a lowercase English word on it. You would …

题目： Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You m…

  Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all th…

  Your are given an array of positive integers nums. Count and print the number of (contiguous) subarrays…

  Given two integers L and R, find the count of numbers in the range [L, R] (inc…

Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes’ values. …

题目 给定一个数组 nums，有一个大小为 k 的滑动窗口从数组的最左侧移动到数组的最右侧。你只可以看到在滑动窗口 k 内的数字。滑动窗口每次只向右移动一位。 返回滑动窗口最大值。 示例: 输入: nums = [1,3…

  二分查找法作为一种常见的查找方法，将原本是线性时间提升到了对数时间范围，大大缩短了搜索时间，具有很大的应用场景，而在LeetCode中，要运用二分搜索法来解的题目也有很多，但是实际上二分查找法的查找目标有很…

  Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*'…

题目： Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in…

题目： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example…