leetcode 467. Unique Substrings in Wraparound String | 467. 环绕字符串中唯一的子字符串（动态规划）

题目

https://leetcode.com/problems/unique-substrings-in-wraparound-string/

题解

1、dp 超时版本

class Solution {public int findSubstringInWraproundString(String p) {HashSet<Integer>[] arr = new HashSet[26]; // <结尾字母，长度>for (int i = 0; i < 26; i++) {arr[i] = new HashSet();}arr[p.charAt(0) - 'a'].add(1);int curLen = 1; // 避免误将断链情况计入结果for (int i = 1; i < p.length(); i++) {arr[p.charAt(i) - 'a'].add(1);if (p.charAt(i) == 'a' && p.charAt(i - 1) == 'z') {curLen++;for (int len : arr[25]) {if (len + 1 <= curLen) arr[0].add(len + 1);}} else if (p.charAt(i - 1) == p.charAt(i) - 1) {curLen++;for (int len : arr[p.charAt(i - 1) - 'a']) {if (len + 1 <= curLen) arr[p.charAt(i) - 'a'].add(len + 1);}} else {curLen = 1;}}int result = 0;for (int i = 0; i < 26; i++) {result += arr[i].size();}return result;}
}

2、dp 答案版本

参考：Concise Java solution using DP

After failed with pure math solution and time out with DFS solution, I finally realized that this is a DP problem…
The idea is, if we know the max number of unique substrings in p ends with 'a', 'b', ..., 'z', then the summary of them is the answer. Why is that?

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.

Hope I made myself clear…

class Solution {public int findSubstringInWraproundString(String p) {int[] dp = new int[26]; // <结尾字母，以当前字母结尾的最长串长度>dp[p.charAt(0) - 'a'] = 1;int curLen = 1;for (int i = 1; i < p.length(); i++) {if (p.charAt(i - 1) == p.charAt(i) - 1 || p.charAt(i) == 'a' && p.charAt(i - 1) == 'z') {curLen++;} else {curLen = 1;}dp[p.charAt(i) - 'a'] = Math.max(dp[p.charAt(i) - 'a'], curLen);}int result = 0;for (int i = 0; i < 26; i++) {result += dp[i];}return result;}
}

leetcode 467. Unique Substrings in Wraparound String | 467. 环绕字符串中唯一的子字符串（动态规划）相关推荐

467. Unique Substrings in Wraparound String
467. Unique Substrings in Wraparound String 题目的意思是给一个无限循环的大字符串s,然后给一个小串p,求出p的子串在s中的个数: 首先可以将其分为26个状态 ...
【宫水三叶的刷题日记】467. 环绕字符串中唯一的子字符串（中等）
题目描述这是 LeetCode 上的 467. 环绕字符串中唯一的子字符串 ,难度为中等. Tag : 「线性 DP」.「树状数组」把字符串 s 看作是 "abcdefghijklmn ...
[leetcode] 467. Unique Substrings in Wraparound String
Description Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrst ...
Leetcode 467. Unique Substrings in Wraparound String
题目链接:Unique Substrings in Wraparound String Consider the string s to be the infinite wraparound stri ...
leetcode - 467. 环绕字符串中唯一的子字符串
解题思路:dp[i]表示以第i个字母结尾的最长的子字符串的长度.那么字符串P的不同子字符串的数量为dp[0] + dp[1] + - + dp[25] (从a一直加到z).循环P中的每一个字符,不断更 ...
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 ...
leetcode算法题--环绕字符串中唯一的子字符串★
原题链接:https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string/ 思路是dp数组保存以26个字母为结尾的子字符 ...
LeetCode 467. 环绕字符串中唯一的子字符串（思维转换）
1. 题目把字符串 s 看作是"abcdefghijklmnopqrstuvwxyz"的无限环绕字符串,所以 s 看起来是这样的:"-zabcdefghijklmnop ...

leetcode 467. Unique Substrings in Wraparound String | 467. 环绕字符串中唯一的子字符串（动态规划）

题目

题解

1、dp 超时版本

2、dp 答案版本

leetcode 467. Unique Substrings in Wraparound String | 467. 环绕字符串中唯一的子字符串（动态规划）相关推荐

最新文章

热门文章