作者归档:在线疯狂

RSS feed of 在线疯狂

[LeetCode]Count Different Palindromic Subsequences

题目描述:

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 Weekly Contest 58解题报告

LeetCode Weekly Contest 58是LeetCode举办的第六十二场正式周赛,共4道题目,比赛时长1.5小时。

比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-58/

题解列表:

LeetCode 724. Find Pivot Index

LeetCode 725. Split Linked List in Parts

LeetCode 726. Number of Atoms

LeetCode 727. Minimum Window Subsequence