LeetCode:Longest Substring Without Repeating Characters(java)

最新推荐文章于 2020-11-21 05:42:28 发布

原创最新推荐文章于 2020-11-21 05:42:28 发布 · 238 阅读

0 ·

CC 4.0 BY-SA版权

本文深入探讨了寻找字符串中最长无重复字符子串的算法实现，通过具体示例展示了如何逐步迭代并记录最长子串的过程。文章提供了一段Java代码，用于计算给定字符串中不包含重复字符的最长子串长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package LeetCode;

/**
 * 题目：
 *      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
 */
public class LengthOfLongestSubstring_03_1009 {
    public int LengthOfLongestSubstring(String s){
        String result = "";//存放最长的字符串
        String temp = "";
        int tail = 0;

        while (tail < s.length()) {
            if (!temp.contains(s.charAt(tail) + "")) {
                temp += s.charAt(tail);
                tail++;

                if (temp.length() > result.length()) {
                    result = temp;
                }
            }
            else {
                temp = temp.substring(1);
            }
        }
        return result.length();
    }

    public static void main(String[] args) {
        String s = "pwwkew";

        LengthOfLongestSubstring_03_1009 test = new LengthOfLongestSubstring_03_1009();
        int result = test.LengthOfLongestSubstring(s);
        System.out.println(result);
    }
}