Given a string, find the longest substring without repeating characters, and return its length. - Code World

Given a string, find the longest substring without repeating characters, and return its length.

Enterprise 2023-07-28 23:34:07 views: null

string='vjlsdnvjkbgdfbvkzxjcnvlsjdkscbgpwiufegpuibvczxdivnasbgfry'
ans=0#最长子串的长度
s1=''

for i in range(len(string)):
    for s in string[i:]:
        if s in s1:
            if len(s1)>ans:
                ans=len(s1)
                print(s1)
                s1=''
        else:
            s1+=s

print(ans)

Guess you like

Origin blog.csdn.net/qq_27900321/article/details/130238640

Given a string, find the longest substring without repeating characters, and return its length.

Find the longest string substring of characters without repeating

Front-end interview questions-given a string, find the longest substring length without repeated characters

LeetCode 1100. Find K-Length Substrings With No Repeated Characters Longest Substring Without Repeating Characters

Algorithm: The longest string without repeating characters 3. Longest Substring Without Repeating Characters

题3、 Longest Substring Without Repeating Characters

[3] leetcode characters without repeating the longest substring

LeetCode 20200312 (without repeating the longest substring of characters)

0003 characters without repeating the longest substring

3. Longest Substring Without Repeating Characters

Solution to the longest substring problem without repeating characters

Algorithm - Longest substring without repeating characters (03)

[LeetCode] Longest substring without repeating characters & longest palindromic substring

[LeetCode] 3. Longest Substring Without Repeating Characters longest substring of characters without repeating

Leetcode3. Longest Substring Without Repeating Characters (the longest substring without repeating characters)

length of the longest substring without repeating character

Find the longest consecutive substring of numbers in a string, output the string and its length

leetcode Given a string s, please find the length hash set of the longest substring that does not contain repeated characters unordered_set C++

Given a string, find its first non-repeating characters, and returns its index. If not, it returns -1.

leetcode-mid-array-3 Longest Substring Without Repeating Characters

Leetcode - 3 characters without repeating the longest substring python

leetcode_3 Longest Substring Without Repeating Characters

LeetCode- longest substring of characters without repeating (sliding window method)

Medium distal algorithm - the longest substring of characters without repeating

leetcode-03 characters without repeating the longest substring

LC 3. Longest Substring Without Repeating Characters

LeetCode-0003 characters without repeating the longest substring

P91 without repeating the longest substring of characters (leetcode 3)

LeetCode 3.Longest Substring Without Repeating Characters【Java】

[LeetCode] 3. Longest Substring Without Repeating Characters (C++)

Recommended

Ranking

Linux关机和重启详解（shutdown、halt、poweroff、reboot、init）

Netty work notes 0007---NIO's three core component relationships

Knife4j tutorial

2021.10.29，内容:什么时候用接口和抽象类

How to solve the problem that changing the memory frequency causes the computer to become unusable?

SpringMVC Tutorial - Controller

linux learning skills -Linux 25 transport Vega paid special privileges and facl extension

Financial quarterly report evaluation report data automatic generation 1.0

Agile Development Series - The Values of Agile Development

scrapy achieve browsercookie Middleware

Daily

More

2024-05-19(0)

2024-05-18(31)

2024-05-17(6)

2024-05-16(23)

2024-05-15(5)

2024-05-14(9)

2024-05-13(8)

2024-05-12(28)

2024-05-11(32)

2024-05-10(34)