LeetCode Weekly Contest 23是LeetCode举办的第二十八场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-23/
题解列表：
LeetCode 541. Reverse String II
LeetCode 539. Minimum Time Difference
档案日期2017的10
2017年3月6日 - 2017年3月12日
LeetCode Weekly Contest 23解题报告
[LeetCode]Word Abbreviation
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 527. Word Abbreviation
Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below.
- Begin with the first character and then the number of characters abbreviated, which followed ...
[LeetCode]Construct Binary Tree from String
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 536. Construct Binary Tree from String
You need to construct a binary tree from a string consisting of parenthesis and integers.
The whole input represents a binary tree. It contains an integer followed by zero, one or two ...
[LeetCode]Minimum Time Difference
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 539. Minimum Time Difference
Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list.
Example 1:
Input: ["23:59","00:00"] Output: 1 ...
[LeetCode]Reverse String II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 541. Reverse String II
Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left ...