LeetCode Weekly Contest 11是LeetCode举办的第十四场正式周赛，共4道题目，比赛时长2小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-11/
题解列表：
LeetCode 434. Number of Segments in a String
归档 2016年12月
LeetCode Weekly Contest 11解题报告
[LeetCode]Count The Repetitions
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 466. Count The Repetitions
Define S = [s,n] as the string S which consists of n connected strings s. For example, ["abc", 3] ="abcabcabc".
On the other hand, we define that string s1 can be obtained from string ...
[LeetCode]Unique Substrings in Wraparound String
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 467. Unique Substrings in Wraparound String
Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".
Now we have another string p. Your job is to find ...
[LeetCode]Convex Polygon
作者是
发布于
在
LeetCode.
题目描述：
Given a list of points that form a polygon when joined sequentially, find if this polygon is convex (Convex polygon definition).
Note:
- There are at least 3 and at most 10,000 points.
- Coordinates are ...
[LeetCode]Number of Segments in a String
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 434. Number of Segments in a String
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.
For example,
Input: "Hello, my name is John"
Output: 5 ...