LeetCode 0003 - Longest Substring Without Repeating Characters

Reck Zhang

发布于 2021-08-11 10:16:01

1910

发布于 2021-08-11 10:16:01

文章被收录于专栏：Reck Zhang

Longest Substring Without Repeating Characters

Desicription

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

Solution

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        if(s.empty())
            return 0;
        int res = 1;
        int left = 0;
        int right = 0;
        bool book[200];
        memset(book, 0, sizeof(book));
        for(right = 0; s[right]; right++){
            while(book[(int) s[right]] && left != right){
                book[(int) s[left]] = 0;
                left++;
            }
            book[(int) s[right]] = 1;
            res = max(right - left + 1, res);
        }
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-07，如有侵权请联系 cloudcommunity@tencent.com 删除

javascript