# 归档 2018年3月

## 题目描述：

LeetCode 802. Find Eventual Safe States

In a directed graph, we start at some node and every turn, walk along a directed edge of the graph.  If we reach a node that is terminal (that is, it has ...

## 题目描述：

LeetCode 801. Minimum Swaps To Make Sequences Increasing

We have two integer sequences `A` and `B` of the same non-zero length.

We are allowed to swap elements `A[i]` and `B[i]`.  Note that both elements are in ...

## 题目描述：

LeetCode 800. Similar RGB Color

In the following, every capital letter represents some hexadecimal digit from `0` to `f`.

The red-green-blue color `"#AABBCC"` can be written as `"#ABC"` in shorthand.  For example, `"#15c"` is shorthand for the ...

## LeetCode Weekly Contest 75解题报告 作者是 在线疯狂 发布于 2018年3月11日 在 LeetCode.

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

LeetCode 796. Rotate String

LeetCode 797. All Paths From Source to Target

LeetCode 799. Champagne Tower

LeetCode 798. Smallest Rotation with Highest Score

## 题目描述：

LeetCode 798. Smallest Rotation with Highest Score

Given an array `A`, we may rotate it by a non-negative integer `K` so that the array becomes `A[K], A[K+1], A{K+2], ... A[A.length - 1], A[0 ...`