LeetCode Weekly Contest 39是LeetCode举办的第四十四场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-39/
题解列表：
LeetCode 633. Sum of Square Numbers
LeetCode 635. Design Log Storage System
归档 2017年7月
LeetCode Weekly Contest 39解题报告
[LeetCode]Smallest Range
作者是
发布于
在
LeetCode.
题目描述：
You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists.
We define the range [a,b] is smaller than ...
[LeetCode]Find the Derangement of An Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 634. Find the Derangement of An Array
In combinatorial mathematics, a derangement is a permutation of the elements of a set, such that no element appears in its original position.
There's originally an array consisting of n integers ...
[LeetCode]Design Log Storage System
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 635. Design Log Storage System
You are given several logs that each log contains a unique id and timestamp. Timestamp is a string that has the following format: Year:Month:Day:Hour:Minute:Second, for example, 2017:01 ...
[LeetCode]Sum of Square Numbers
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 633. Sum of Square Numbers
Given a non-negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c.
Example 1:
Input: 5 Output: True Explanation: 1 * 1 ...