Longest Substring Without Repeating Characters --- LeetCode

最新推荐文章于 2024-04-28 22:28:42 发布

Edwardwe

最新推荐文章于 2024-04-28 22:28:42 发布

阅读量182

点赞数 1

分类专栏： java

本文链接：https://blog.csdn.net/Edwardwe/article/details/82056625

版权

java 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Problem:

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

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", which the length is 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.

import java.util.LinkedHashSet;
class Solution {
    public int lengthOfLongestSubstring(String s) {
        
        if(s.length()==0||s.length()==1) return s.length();
        Set set=new LinkedHashSet();
        set.add(s.charAt(0));
        int index=0;
        int csize=1;
        int max=1;
        for(int i=1;i<s.length();i++){
            set.add(s.charAt(i));
            if(set.size()>csize){
                csize++;
            }
            else{
                if(max<csize){
                    max=csize;
                }
                set.clear();
                csize=0;
                index=s.indexOf(s.charAt(i),index)+1;
                i=index-1;
            }   
        }
        if(max<csize){
            max=csize;
        }
        return max;
    }
}