题目描述：
LeetCode 662. Maximum Width of Binary Tree
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has ...
归档 2017
[LeetCode]Maximum Width of Binary Tree
[LeetCode]Image Smoother
作者是
发布于
在
LeetCode.
题目描述：
Given a 2D integer matrix M representing the gray scale of an image, you need to design a smoother to make the gray scale of each cell becomes the average gray scale (rounding down) of ...
LeetCode Weekly Contest 45解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 45是LeetCode举办的第五十场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-45/
题解列表：
LeetCode 657. Judge Route Circle
LeetCode 658. Find K Closest Elements
[LeetCode]Remove 9
作者是
发布于
在
LeetCode.
题目描述：
Start from integer 1, remove any integer that contains 9 such as 9, 19, 29...
So now, you will have a new integer sequence: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, ...
Given ...
[LeetCode]Split Array into Consecutive Subsequences
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 659. Split Array into Consecutive Subsequences
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers. Return ...