LeetCode Weekly Contest 37是LeetCode举办的第四十二场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-37/
题解列表：
LeetCode 624. Maximum Distance in Arrays
LeetCode 623. Add One Row to Tree
档案日期2017的24
2017年6月12日 - 2017年6月18日
LeetCode Weekly Contest 37解题报告
[LeetCode]Task Scheduler
作者是
发布于
在
LeetCode.
题目描述：
Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each task could be done ...
[LeetCode]Minimum Factorization
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 625. Minimum Factorization
Given a positive integer a, find the smallest positive integer b whose multiplication of each digit equals to a.
If there is no answer or the answer is not fit in 32-bit signed integer, then ...
[LeetCode]Add One Row to Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 623. Add One Row to Tree
Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node ...
[LeetCode]Maximum Distance in Arrays
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 624. Maximum Distance in Arrays
Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the ...