# 归档 2016

## LeetCode Weekly Contest 11解题报告 作者是 在线疯狂 发布于 2016年12月4日 在 LeetCode.

LeetCode Weekly Contest 11是LeetCode举办的第十四场正式周赛，共4道题目，比赛时长2小时。

LeetCode 434. Number of Segments in a String

LeetCode 469. Convex Polygon

LeetCode 467. Unique Substrings in Wraparound String

LeetCode 466. Count The Repetitions

## 题目描述：

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 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 469. Convex Polygon

Given a list of points that form a polygon when joined sequentially, find if this polygon is convex (Convex polygon definition).

Note:

1. There are at least 3 and at most 10,000 points.
2. Coordinates are ...

## 题目描述：

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