leetcode - 2981. Find Longest Special Substring That Occurs Thrice I

Description

You are given a string s that consists of lowercase English letters.

A string is called special if it is made up of only a single character. For example, the string "abc" is not special, whereas the strings "ddd", "zz", and "f" are special.

Return the length of the longest special substring of s which occurs at least thrice, or -1 if no special substring occurs at least thrice.

A substring is a contiguous non-empty sequence of characters within a string.

Example 1:

Input: s = "aaaa"
Output: 2
Explanation: The longest special substring which occurs thrice is "aa": substrings "aaaa", "aaaa", and "aaaa".
It can be shown that the maximum length achievable is 2.

Example 2:

Input: s = "abcdef"
Output: -1
Explanation: There exists no special substring which occurs at least thrice. Hence return -1.

Example 3:

Input: s = "abcaba"
Output: 1
Explanation: The longest special substring which occurs thrice is "a": substrings "abcaba", "abcaba", and "abcaba".
It can be shown that the maximum length achievable is 1.

Constraints:

3 <= s.length <= 50
s consists of only lowercase English letters.

Solution

Brute Force

Because of the low constrains, a very simple brute force way would be: we get all the special subarrays, and then calculate each one's frequency, then get the largest length of the subarrays that meet the requirements.

Time complexity: o ( n 3 ) o(n^3) o(n3)

Space complexity: o ( 1 ) o(1) o(1)

With a more strict constrain, see this 2982. Find Longest Special Substring That Occurs Thrice II

Code

Brute Force

python3 复制代码
class Solution:
    def maximumLength(self, s: str) -> int:
        res = -1
        # s[i:j+1]
        for i in range(len(s)):
            for j in range(i, len(s)):
                if s[j] != s[i]:
                    break
                sub_string = s[i: j + 1]
                sub_string_fre = 0
                for k in range(0, len(s)):
                    if k + j + 1 - i > len(s):
                        break
                    if sub_string == s[k: k + j + 1 - i]:
                        sub_string_fre += 1
                if sub_string_fre >= 3:
                    res = max(res, j + 1 - i)
        return res
相关推荐
机器学习之心5 分钟前
一区正弦余弦算法!SCA-SVM正弦余弦算法优化支持向量机多特征分类预测
算法·支持向量机·分类·sca-svm·正弦余弦算法优化
a栋栋栋38 分钟前
刷算法心得
算法
CC大煊1 小时前
【Linux】vi/vim 使用技巧
linux·运维·vim
華華3551 小时前
读程序题...
开发语言·c++·算法
是十一月末1 小时前
Linux的基本功能和命令
linux·服务器·开发语言·数据库
暮已深1 小时前
【RTAB-Map+VINS-Fusion+euroc】(Ubuntu 20.04)三维稠密重建-实践笔记
linux·笔记·ubuntu
浮尘笔记1 小时前
在Ubuntu服务器上备份文件到自己的百度网盘
linux·服务器·ubuntu
宸码2 小时前
【机器学习】手写数字识别的最优解:CNN+Softmax、Sigmoid与SVM的对比实战
人工智能·python·神经网络·算法·机器学习·支持向量机·cnn
Hacker_xingchen2 小时前
影响 Linux、Unix 系统的 CUPS 漏洞可导致 RCE
linux·运维·unix
难以触及的高度2 小时前
Unix/Linux 命令行重定向操作
linux·服务器·unix