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
相关推荐
van叶~4 分钟前
Linux探秘坊-------4.进度条小程序
linux·运维·小程序
秋风&萧瑟5 分钟前
【数据结构】顺序队列与链式队列
linux·数据结构·windows
我科绝伦(Huanhuan Zhou)12 分钟前
Linux 系统服务开机自启动指导手册
java·linux·服务器
hunter2062062 小时前
ubuntu终端当一段时间内没有程序运行时,自动关闭终端。
linux·chrome·ubuntu
代码讲故事4 小时前
从Windows通过XRDP远程访问和控制银河麒麟ukey v10服务器,以及多次连接后黑屏的问题
linux·运维·服务器·windows·远程连接·远程桌面·xrdp
小孟Java攻城狮4 小时前
leetcode-不同路径问题
算法·leetcode·职场和发展
查理零世4 小时前
算法竞赛之差分进阶——等差数列差分 python
python·算法·差分
qq_243050796 小时前
irpas:互联网路由协议攻击套件!全参数详细教程!Kali Linux入门教程!黑客渗透测试!
linux·网络·web安全·网络安全·黑客·渗透测试·系统安全
IT北辰6 小时前
Linux下 date时间应该与系统的 RTC(硬件时钟)同步
linux·运维·实时音视频
Jason Yan6 小时前
【经验分享】ARM Linux-RT内核实时系统性能评估工具
linux·arm开发·经验分享