题目描述：
LeetCode 663. Equal Tree Partition
Given a binary tree with n nodes, your task is to check if it's possible to partition the tree to two trees which have the equal sum of values after removing exactly one edge ...
标签归档：leetcode
[LeetCode]Equal Tree Partition
[LeetCode]Maximum Width of Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
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 ...
[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 ...