[LeetCode]Swap Adjacent in LR String

题目描述:

LeetCode 777. Swap Adjacent in LR String

In a string composed of 'L', 'R', and 'X' characters, like "RXXLRXRXL", a move consists of either replacing one occurrence of "XL" with "LX", or replacing one occurrence of "RX" with "XR" ...

继续阅读

LeetCode Weekly Contest 69解题报告

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

比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-69/

题解列表:

LeetCode 771. Jewels and Stones

LeetCode 775. Global and Local Inversions

LeetCode 773. Sliding Puzzle

LeetCode 774. Minimize Max Distance to Gas Station

[LeetCode]Minimize Max Distance to Gas Station

题目描述:

LeetCode 774. Minimize Max Distance to Gas Station

On a horizontal number line, we have gas stations at positions stations[0], stations[1], ..., stations[N-1], where N = stations.length.

Now, we add K more gas stations so that D ...

继续阅读

年度归档