LeetCode Weekly Contest 69是LeetCode举办的第七十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-69/
题解列表：
LeetCode 771. Jewels and Stones
类别归档：LeetCode
LeetCode OJ is a platform for preparing technical coding interviews.
LeetCode Weekly Contest 69解题报告
[LeetCode]Minimize Max Distance to Gas Station
作者是
发布于
在
LeetCode.
题目描述：
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 ...
[LeetCode]Sliding Puzzle
作者是
发布于
在
LeetCode.
题目描述：
On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.
A move consists of choosing 0 and a 4-directionally adjacent number and swapping ...
[LeetCode]Global and Local Inversions
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 775. Global and Local Inversions
We have some permutation A of [0, 1, ..., N - 1], where N is the length of A.
The number of (global) inversions is the number of i < j with 0 <= i ...
[LeetCode]Jewels and Stones
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 771. Jewels and Stones
You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want ...