LeetCode | Longest Substring Without Repeating Characters

最新推荐文章于 2021-12-03 15:58:56 发布

KarmenChan

最新推荐文章于 2021-12-03 15:58:56 发布

阅读量106

点赞数

分类专栏： LeetCode 文章标签： LeetCode java substring

本文链接：https://blog.csdn.net/Karmen199x/article/details/82787820

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

3.Longest Substring Without Repeating Characters

Description:

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

Example:

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

Solution: (java)

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int length = 0;
        ArrayList substring = new ArrayList();
        for (int i = 0; i < s.length(); i++) {
            for (int j = i; j < s.length(); j++ ) {
                if (substring.contains(s.charAt(j))) {
                    substring.clear();
                    break;
                } else {
                    substring.add(s.charAt(j));
                    if (length < substring.size()) {
                        length = substring.size();
                    }
                }
            }
            substring.clear();
        }
        return length;
    }
}