动态规划-独特的子字符串存在于Wraparound String总个数 Unique Substrings in Wraparound String...

2018-09-01 22:50:59

问题描述：

问题求解：

如果单纯的遍历判断，那么如何去重保证unique是一个很困难的事情，事实上最初我就困在了这个点上。

后来发现是一个动态规划的问题，可以将每个字符结尾的最长长度进行保存，这样就巧妙的解决的重复的问题。

The max number of unique substring ends with a letter equals to the length of max contiguous substring ends with that letter. Example "abcd", the max number of unique substring ends with 'd' is 4, apparently they are "abcd", "bcd", "cd" and "d".

If there are overlapping, we only need to consider the longest one because it covers all the possible substrings. Example: "abcdbcd", the max number of unique substring ends with 'd' is 4 and all substrings formed by the 2nd "bcd" part are covered in the 4 substrings already.

No matter how long is a contiguous substring in p, it is in s since s has infinite length.

Now we know the max number of unique substrings in p ends with 'a', 'b', ..., 'z' and those substrings are all in s. Summary is the answer, according to the question.

    public int findSubstringInWraproundString(String p) {int res = 0;int[] dp = new int[26];int maxLen = 0;for (int i = 0; i < p.length(); i++) {if (i > 0 && (p.charAt(i) - p.charAt(i - 1) == 1 || p.charAt(i - 1) - p.charAt(i) == 25)) {maxLen++;}else maxLen = 1;dp[p.charAt(i) - 'a'] = Math.max(dp[p.charAt(i) - 'a'], maxLen);}for (int i = 0; i < 26; i++) res += dp[i];return res;}

转载于:https://www.cnblogs.com/hyserendipity/p/9572041.html

动态规划-独特的子字符串存在于Wraparound String总个数 Unique Substrings in Wraparound String...相关推荐

[leetcode] 467. Unique Substrings in Wraparound String
Description Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrst ...
算法作业系列10——Unique Substrings in Wraparound String
算法作业系列(十) Unique Substrings in Wraparound String 写在前面如果你是因为没有思路来找答案的,这里建议你去看看题目的s,因为s是一个连续字母的字符串,所以 ...
Leetcode 467. Unique Substrings in Wraparound String
题目链接:Unique Substrings in Wraparound String Consider the string s to be the infinite wraparound stri ...
467. Unique Substrings in Wraparound String
467. Unique Substrings in Wraparound String 题目的意思是给一个无限循环的大字符串s,然后给一个小串p,求出p的子串在s中的个数: 首先可以将其分为26个状态 ...
[LeetCode]Unique Substrings in Wraparound String@Python
Unique Substrings in Wraparound String Consider the string s to be the infinite wraparound string of ...
leetcode - 467. Unique Substrings in Wraparound String
算法系列博客之Dynamic Programming 本篇博客将运用动态规划的思想来解决leetcode上467号问题问题描述: Consider the string s to be the in ...
【LeetCode】467. Unique Substrings in Wraparound String 解题报告（Python）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址: https://leetcode.com/problems/unique-s ...
LeetCode467. Unique Substrings in Wraparound String
题目 Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz&qu ...
Leetcode-467. Unique Substrings in Wraparound String
前言:为了后续的实习面试,开始疯狂刷题,非常欢迎志同道合的朋友一起交流.因为时间比较紧张,目前的规划是先过一遍,写出能想到的最优算法,第二遍再考虑最优或者较优的方法.如有错误欢迎指正.博主首发CSDN ...

动态规划-独特的子字符串存在于Wraparound String总个数 Unique Substrings in Wraparound String...

动态规划-独特的子字符串存在于Wraparound String总个数 Unique Substrings in Wraparound String...相关推荐

最新文章

热门文章