# 归档 2017年7月2日

## LeetCode Weekly Contest 39解题报告 作者是 在线疯狂 发布于 2017年7月2日 在 LeetCode.

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

LeetCode 633. Sum of Square Numbers

LeetCode 635. Design Log Storage System

LeetCode 634. Find the Derangement of An Array

LeetCode 632. Smallest Range

## 题目描述：

LeetCode 632. Smallest Range

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