3.Longest Substring Without Repeating Characters（7.66%）

最新推荐文章于 2024-01-06 13:50:14 发布

ithouse

最新推荐文章于 2024-01-06 13:50:14 发布

阅读量425

点赞数

分类专栏： LeetCode 文章标签： leetcode java面试 java面试题目 substring repeating

本文链接：https://blog.csdn.net/ithouse/article/details/50471418

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “bbbbb” the longest substring is “b”, with the length of 1.

个人理解：求最长的没有重复的字符串的长度。刚开始的时候贪图便利，用Java自带的字符串方法进行操作，结果超时了：

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        int inputLength = s.length();

        int longestLength = 0;
        for (int i = 0; i < inputLength; i++) {
            String tempString = String.valueOf(s.charAt(i));

            for (int j = i + 1; j < inputLength; j++) {
                String character = String.valueOf(s.charAt(j));
                if (tempString.contains(character)) {
                    break;
                } else {
                    tempString = tempString.concat(character);
                }
            }
            longestLength = longestLength > tempString.length() ? longestLength : tempString.length();
        }

        return longestLength;
    }
}

后来百度了一下，才想起Java字符数组：

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        int inputLength = s.length();
        char[] chars = s.toCharArray();

        int longestLength = 0;
        for (int i = 0; i < inputLength; i++) {
            int oneLength = 0;
            for (int j = i + 1; j < inputLength; j++) {

                boolean isLegal = true;
                for (int k = i; k < j; k++) {
                    if (chars[k] == chars[j]) {
                        isLegal = false;
                        break;
                    }
                }

                if (isLegal) {
                    oneLength++;
                } else {
                    break;
                }
            }

            oneLength++;
            longestLength = longestLength > oneLength ? longestLength : oneLength;

            if (longestLength == inputLength) {
                return longestLength;
            }
        }
        return longestLength;
    }
}