เฉลยโจทย์ Longest Substring Without Repeating Characters ด้วยวิธีเขียนโปรแกรมภาษา Python

Source Code:

class Solution:
    def lengthOfLongestSubstring(self, s):
        seen = set()
        left = 0
        max_length = 0

        for right in range(len(s)):

            while s[right] in seen:
                seen.remove(s[left])
                left += 1

            seen.add(s[right])

            current_length = right - left + 1
            max_length = max(max_length, current_length)

        return max_length

solution = Solution()

print(solution.lengthOfLongestSubstring("abcabcbb"))

print(solution.lengthOfLongestSubstring("bbbbb"))

print(solution.lengthOfLongestSubstring("pwwkew"))

ตัวอย่างผลลัพธ์: