[LeetCode]Unique Substrings in Wraparound String@Python

最新推荐文章于 2024-02-10 12:02:28 发布

Goofiness

最新推荐文章于 2024-02-10 12:02:28 发布

阅读量125

点赞数

分类专栏： leetcode dynamic programming 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/97395032

版权

leetcode 同时被 2 个专栏收录

232 篇文章 0 订阅

订阅专栏

dynamic programming

43 篇文章 0 订阅

订阅专栏

Unique Substrings in Wraparound String

Consider the string s to be the infinite wraparound string of “abcdefghijklmnopqrstuvwxyz”, so s will look like this: “…zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd…”.

Now we have another string p. Your job is to find out how many unique non-empty substrings of p are present in s. In particular, your input is the string p and you need to output the number of different non-empty substrings of p in the string s.

Note: p consists of only lowercase English letters and the size of p might be over 10000.

Example

Input: “zab”
Output: 6
Explanation: There are six substrings “z”, “a”, “b”, “za”, “ab”, “zab” of string “zab” in the string s.

Solution

class Solution:
    def findSubstringInWraproundString(self, p: str) -> int:
        res = {i:1 for i in p}
        l = 1
        for i,j in zip(p, p[1:]):
            l = l+1 if (ord(j)-ord(i))%26 == 1 else 1
            res[j] = max(res[j], l)
        return sum(res.values())