LeetCode-Minimum Window Substring -- 窗口问题

题目描述 Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S&nb
31次阅读

2555: SubString[LCT+SAM]

2555: SubString Time Limit: 30 Sec  Memory Limit: 512 MBSubmit: 2601  Solved: 780[Submit][Status][Discuss]Desc
20次阅读

poj3693 Maximum repetition substring

 Maximum repetition substringTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9757 Accepted: 3004Descripti
23次阅读

SPOJ1812 LCS2 - Longest Common Substring II

本文版权归ljh2000和博客园共有,欢迎转载,但须保留此声明,并给出原文链接,谢谢合作。   本文作者:ljh2000 作者博客:http://www.cnblogs.com/ljh2000-jump/转载请注明出处,侵权必究,保留最终解释权! 题目链接:S
24次阅读

SPOJ1811 LCS - Longest Common Substring

本文版权归ljh2000和博客园共有,欢迎转载,但须保留此声明,并给出原文链接,谢谢合作。  本文作者:ljh2000 作者博客:http://www.cnblogs.com/ljh2000-jump/转载请注明出处,侵权必究,保留最终解释权! 题目链接:SPOJ181
25次阅读

[BZOJ2555]SubString

[BZOJ2555]SubString试题描述懒得写背景了,给你一个字符串init,要求你支持两个操作(1):在当前字符串的后面插入一个字符串(2):询问字符串s在当前字符串中出现了几次?(作为连续子串)你必须在线支持这些操作。输入第一行一个数Q表示操作个数第二行一个字符串表示初始字符串init接下
17次阅读

[SPOJ7258]Lexicographical Substring Search

[SPOJ7258]Lexicographical Substring Search试题描述Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowi
29次阅读

[SPOJ1812]Longest Common Substring II

[SPOJ1812]Longest Common Substring II试题描述A string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowe
22次阅读

[POJ3693]Maximum repetition substring

[POJ3693]Maximum repetition substring试题描述The repetition number of a string is defined as the maximum number R such that the string can be pa
19次阅读

substring类型题目的解题模板

 https://discuss.leetcode.com/topic/30941/here-is-a-10-line-template-that-can-solve-most-substring-problems 总结的还是不错的:int findSubstring(strin
26次阅读