# 归档 2017年8月

## LeetCode Weekly Contest 46解题报告 作者是 在线疯狂 发布于 2017年8月21日 在 LeetCode.

LeetCode Weekly Contest 46是LeetCode举办的第五十一场正式周赛，共4道题目，比赛时长1.5小时。

LeetCode 661. Image Smoother

LeetCode 662. Maximum Width of Binary Tree

LeetCode 663. Equal Tree Partition

LeetCode 664. Strange Printer

## 题目描述：

LeetCode 664. Strange Printer

There is a strange printer with the following two special requirements:

1. The printer can only print a sequence of the same character each time.
2. At each turn, the printer can print new characters starting from ...

## 题目描述：

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 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 661. Image Smoother

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 ...