LeetCode 003 Longest Substring Without Repeating Characters

最新推荐文章于 2020-09-07 09:59:42 发布

原创最新推荐文章于 2020-09-07 09:59:42 发布 · 416 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #substring

LeetCode 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一种算法，用于解决字符串中无重复字符最长子串的问题，通过实例演示了如何实现并计算子串长度。

package ywheel.leetcode._003_longest_substring_without_repeating_characters;

/**
 * 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.
 * 
 * @author ywheel
 * 
 */
public class LongestSubString {
    public int lengthOfLongestSubstring(String s) {
        if (s == null || s.isEmpty()) {
            return 0;
        }
        int maxLength = 0;
        int[] index = new int[256];
        for (int i = 0; i < 256; i++) {
            index[i] = -1;
        }
        int strLen = s.length();
        int length = 1;
        index[s.charAt(0)] = 0;
        for (int i = 1; i < strLen; i++) {
            char ch = s.charAt(i);
            if (i - index[ch] <= length) {
                // repeat
                maxLength = length > maxLength ? length : maxLength;
                length = i - index[ch];
            } else {
                length++;
            }
            index[ch] = i; // set the last index of ch
        }
        maxLength = length > maxLength ? length : maxLength;
        return maxLength;
    }

    public static void main(String[] args) {
        LongestSubString solution = new LongestSubString();
        String s = "abcabcbb";
        System.out.println(solution.lengthOfLongestSubstring(s));
        s = "bbbbbb";
        System.out.println(solution.lengthOfLongestSubstring(s));
    }
}