原文链接: https://leetcode-cn.com/problems/implement-strstr
英文原文Implement strStr().
Return the index of the first occurre
标签详情
愿你|
字符串匹配 分类
原文链接: https://leetcode-cn.com/problems/repeated-substring-pattern
英文原文Given a string s, check if it can be constructed
原文链接: https://leetcode-cn.com/problems/subtree-of-another-tree
英文原文Given the roots of two binary trees root and subRoo
原文链接: https://leetcode-cn.com/problems/repeated-string-match
英文原文Given two strings a and b, return the minimum nu
原文链接: https://leetcode-cn.com/problems/rotate-string
英文原文Given two strings s and goal, return true if and only if s ca
原文链接: https://leetcode-cn.com/problems/longest-happy-prefix
英文原文A string is called a happy prefix if is a non-empty pr
原文链接: https://leetcode-cn.com/problems/find-all-good-strings
英文原文Given the strings s1 and s2 of size n and the string
原文链接: https://leetcode-cn.com/problems/string-matching-in-an-array
英文原文Given an array of string words. Return all stri
原文链接: https://leetcode-cn.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
英文原文Given a senten
原文链接: https://leetcode-cn.com/problems/maximum-repeating-substring
英文原文For a string sequence, a string word is k-repea
1 / 2