← 返回 amazon 的题目列表Longest Matchable Subsequence Length in Regular Expression
类型:online_judge
amazon
Write a function to find the longest subsequence within a given regular expression. The function takes a regular expression in the form of a string as input and returns the length of the longest subsequence that can be matched.
Example
Input
aabbccddd