最大子串问题

3. Longest Substring Without Repeating Characters

Medium

4549225FavoriteShare

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

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 3. 

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: 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.

class Solution {
public:
    int lengthOfLongestSubstring(string s) {

        if(s.size() == 0)
            return 0;
        int retint = 1,tempint = 1;
        int flag = 0;
        int i = 0;
        int j = i+1;
            while(1)
            {
                if(j>=s.size())
                    break;
                //cout<<j<<endl;
                //cout<<s[j]<<endl;
                for(int k = i;k<j;k++)
                {
                    if(s[j] == s[k])
                    {
                        i = k+1;
                        j = i+1;
                        flag  = 1;
                        break;
                    }
                }

                if(flag == 0)
                {
                    tempint++;
                    j++;
                    if(retint<tempint)
                        retint = tempint;
                }
                else
                {
                    if(retint<tempint)
                        retint = tempint;
                    tempint = 1;
                    flag = 0;
                }
                if(j>=s.size())
                    break;
            }

        return retint;
    }
};