题目描述：
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], A[1], ..., A[K-1]. Afterward, ...
归档 2018
[LeetCode]Smallest Rotation with Highest Score
[LeetCode]Champagne Tower
作者是
发布于
在
LeetCode.
题目描述：
We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Each glass holds one cup (250ml) of champagne.
Then, ...
[LeetCode]All Paths From Source to Target
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 797. All Paths From Source to Target
Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and return them in any order.
The graph is given as follows: ...
[LeetCode]Rotate String
作者是
发布于
在
LeetCode.
题目描述：
We are given two strings, A and B.
A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, if A = 'abcde', then ...
LeetCode Weekly Contest 74解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 74是LeetCode举办的第七十八场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-74/
题解列表：
LeetCode 794. Valid Tic-Tac-Toe State
LeetCode 792. Number of Matching Subsequences