[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 ...

继续阅读

LeetCode Weekly Contest 68解题报告

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

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

题解列表:

LeetCode 766. Toeplitz Matrix

LeetCode 767. Reorganize String

LeetCode 769. Max Chunks To Make Sorted

LeetCode 768. Max Chunks To Make Sorted II

LeetCode 770. Basic ...

继续阅读