题目描述：
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 no ...
归档 2018年3月18日
[LeetCode]Find Eventual Safe States
[LeetCode]Minimum Swaps To Make Sequences Increasing
作者是
发布于
在
LeetCode.
题目描述：
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 the same ...
[LeetCode]Similar RGB Color
作者是
发布于
在
LeetCode.
题目描述：
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 color "#1155cc". ...