Longest Substring Without Repeating Characters（无重复最长子串）

最新推荐文章于 2024-10-13 18:33:13 发布

rodman177

最新推荐文章于 2024-10-13 18:33:13 发布

阅读量84

点赞数

分类专栏： LeetCode刷题数据结构与算法文章标签： leetcode java

本文链接：https://blog.csdn.net/rodman177/article/details/90083441

版权

LeetCode刷题同时被 2 个专栏收录

25 篇文章 0 订阅

订阅专栏

数据结构与算法

9 篇文章 0 订阅

订阅专栏

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” is a subsequence and not a substring.

 /**
     *暴力破解法
     * 时间复杂度O(N*N*N)
     * @param
     * @param start
     * @param end
     * @return
     */
    public static boolean allUnique(String s, int start, int end)
    {
        Set<Character> set = new HashSet<Character>();
        for(int i = start; i < end; i++)
        {
            if(set.contains(s.charAt(i))) return false;
            set.add(s.charAt(i));
    }
        return true;
    }
    public static int lengthOfLongestSubstring1(String s) {
      int len = s.length();
      int ans = 0;
      for(int i = 0; i < len; i++)
      {
          for(int j = i+1; j<=len;j++)
          {
              if(allUnique(s,i,j))
              {
                  ans = Math.max(ans,j-i);
              }
          }
      }
      return ans;
    }
    /**
     * 滑动窗口法
     * 时间发杂度O(N*N)
     * @param s
     * @return
     */
    public static int lengthOfLongestSubstring2(String s)
{
    Set<Character> set = new HashSet<Character>();
    int len = s.length();
    int i = 0,j=0;
    int ans = 0;
    while(i<len && j<len)
    {
        if(!set.contains(s.charAt(j)))
        {
            ans = Math.max(ans,j-i+1);
            set.add(s.charAt(j++));
        }
        else
        {
            //将已经添加到set集合中的元素从集合中删除，直到集合中不再包含第j个元素为止
            set.remove(s.charAt(i++));
        }
    }
    return ans;
}

    /**
     * 滑动窗口优化
     * @param s
     * @return
     */
    public static  int lengthOfLongestSubstring3(String s)
{
    int len = s.length();
    int ans = 0;
    Map<Character,Integer>map = new HashMap<>();
    int i = 0;
    for(int j = 0; j < len; j++)
    {
        if(map.containsKey(s.charAt(j)))
        {
        //获取到当前元素在map中的value,可以理解为索引值，即为无重复字符的长度
            i = Math.max(map.get(s.charAt(j)),i);
        }
        ans = Math.max(ans, j-i+1);
        map.put(s.charAt(j),j+1);
    }
    return ans;
}