归档 2017年7月

LeetCode Weekly Contest 39解题报告

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

LeetCode 634. Find the Derangement of An Array

LeetCode 632. Smallest Range

[LeetCode]Find the Derangement of An Array

题目描述:

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

继续阅读

每日归档

上个月

下个月

归档