LeetCode Weekly Contest 59是LeetCode举办的第六十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-59/
题解列表：
LeetCode 728. Self Dividing Numbers
标签归档：leetcode
LeetCode Weekly Contest 59解题报告
[LeetCode]My Calendar II
作者是
发布于
在
LeetCode.
题目描述：
Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not cause a triple booking.
Your class will have one method, book(int start, int ...
[LeetCode]Count Different Palindromic Subsequences
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 730. Count Different Palindromic Subsequences
Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7.
A subsequence of a string S is obtained by deleting 0 ...
[LeetCode]My Calendar I
作者是
发布于
在
LeetCode.
题目描述：
Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.
Your class will have the method, book(int start, int ...
[LeetCode]Self Dividing Numbers
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 728. Self Dividing Numbers
A self-dividing number is a number that is divisible by every digit it contains.
For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
Also, a ...