LeetCode Weekly Contest 28是LeetCode举办的第三十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-28/
题解列表：
LeetCode 551. Student Attendance Record I
LeetCode 553. Optimal Division
档案日期2017的15
2017年4月10日 - 2017年4月16日
LeetCode Weekly Contest 28解题报告
[LeetCode]Student Attendance Record II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 552. Student Attendance Record II
Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer may be very large, return it after mod 10 ...
[LeetCode]Split Assembled Strings
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 555. Split Assembled Strings
Given a list of strings, you could assemble these strings together into a loop. Among all the possible loops, you need to find the lexicographically biggest string after cutting and making one breakpoint of ...
[LeetCode]Optimal Division
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 553. Optimal Division
Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4.
However, you can add any number of parenthesis at any position to ...
[LeetCode]Student Attendance Record I
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 551. Student Attendance Record I
You are given a string representing an attendance record for a student. The record only contains the following three characters:
- 'A' : Absent.
- 'L' : Late.
- 'P' : Present.
A student could be rewarded if his ...