题目描述：
LeetCode 485. Max Consecutive Ones
Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three ...
归档 2017年1月
[LeetCode]Max Consecutive Ones
LeetCode Weekly Contest 14解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 14是LeetCode举办的第十七场正式周赛，共4道题目，比赛时长2小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-14/
题解列表：
LeetCode 476. Number Complement
[LeetCode]Sliding Window Median
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 480. Sliding Window Median
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value ...
[LeetCode]License Key Formatting
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 482. License Key Formatting
Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumerical ...
[LeetCode]Magical String
作者是
发布于
在
LeetCode.
题目描述：
A magical string S consists of only '1' and '2' and obeys the following rules:
The string S is magical because concatenating the number of contiguous occurrences of characters '1' and '2' generates the string ...