归档 2017年4月16日

LeetCode Weekly Contest 28解题报告

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

LeetCode 555. Split Assembled Strings

LeetCode 552. Student Attendance Record II

[LeetCode]Student Attendance Record II

题目描述:

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 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]Student Attendance Record I

题目描述:

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:

  1. 'A' : Absent.
  2. 'L' : Late.
  3. 'P' : Present.

A student could be rewarded if his ...

继续阅读

昨天

明天

归档