题目描述：
LeetCode 665. Non-decreasing Array
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.
We define an array is non-decreasing if array[i] <= array[i + 1 ...
[LeetCode]Non-decreasing Array
LeetCode Weekly Contest 46解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 46是LeetCode举办的第五十一场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-46/
题解列表：
LeetCode 662. Maximum Width of Binary Tree
[LeetCode]Strange Printer
作者是
发布于
在
LeetCode.
题目描述：
There is a strange printer with the following two special requirements:
- The printer can only print a sequence of the same character each time.
- At each turn, the printer can print new characters starting from ...
[LeetCode]Equal Tree Partition
作者是
发布于
在
LeetCode.
题目描述：
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]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 ...