LeetCode Weekly Contest 58是LeetCode举办的第六十二场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-58/
题解列表：
LeetCode 724. Find Pivot Index
归档 2017年11月13日
LeetCode Weekly Contest 58解题报告
[LeetCode]Minimum Window Subsequence
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 727. Minimum Window Subsequence
Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W.
If there is no such window in S that covers all characters in ...
[LeetCode]Number of Atoms
作者是
发布于
在
LeetCode.
题目描述：
Given a chemical formula (given as a string), return the count of each atom.
An atomic element always starts with an uppercase character, then zero or more lowercase letters, representing the name.
1 or ...
[LeetCode]Split Linked List in Parts
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 725. Split Linked List in Parts
Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts".
The length of each part should be as equal ...
[LeetCode]Find Pivot Index
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 724. Find Pivot Index
Given an array of integers nums, write a method that returns the "pivot" index of this array.
We define the pivot index as the index where the sum of the numbers to the left ...