zoukankan      html  css  js  c++  java
  • 【LeetCode】3. Longest Substring Without Repeating Characters (2 solutions)

    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.

    双指针begin,end.扩展end,收缩begin.

    [begin,end]之间为无重复字母的子串。

     可与Longest Substring with At Most Two Distinct Characters对照看。

    解法一:

    使用unordered_map记录每个字母最近出现下标。

    [begin, end]表示无重复字符的窗口。

    在end指向一个窗口中的字符时,需要将begin收缩到该字符之后,以免与end重复。

    时间复杂度:O(n)

    空间复杂度:O(n)

    class Solution {
    public:
        int lengthOfLongestSubstring(string s) {
            if(s == "")
                return 0;
                
            unordered_map<char, int> m; //char-index map
            int ret = 1;
            int begin = 0;
            m[s[begin]] = 0;
            int end = 1;
            while(end < s.size())
            {
                //extend
                if(m.find(s[end]) == m.end() || m[s[end]] < begin)
                {
                    ;
                }
                //shrink
                else
                {
                    begin = m[s[end]]+1;
                }
                ret = max(end-begin+1, ret);
                m[s[end]] = end;
                end ++;
            }
            return ret;
        }
    };

    解法二:

    使用record[128]记录A~Z,a~z在窗口中的出现次数。

    由于无重复的要求,因此在end指向一个已经出现过的字母(即record[s[end]]不为零)

    需要收缩begin直到begin遇到end或者record[s[end]]为零。

    class Solution {
    public:
        int lengthOfLongestSubstring(string s) {
            int longest = 0;
            int begin = 0;
            int end = 0;
            int record[128] = {0};  //initial to all 0
            while(end < s.size())
            {
                while(record[s[end]]>0 && begin<end)
                {
                    record[s[begin]] --;
                    begin ++;
                }
                //record[s[end]]==0 || begin==end
                record[s[end]] ++;
                longest = max(longest, end-begin+1);
                end ++;
            }
            return longest;
        }
    };

  • 相关阅读:
    redis list 清空记录小技巧
    fastJson 之 JSONPath使用
    【移动开发】怎样自己定义ViewGroup
    POJ 3255 Roadblocks
    java带图片的邮件发送方法实现
    android学习二(Activity)
    OpenWRT加入 crontab开机默认运行
    ubuntu14.04启动提示set_sw_state failed
    jekyll bootstrap更改主题theme
    windows API 实现截图
  • 原文地址:https://www.cnblogs.com/ganganloveu/p/4179935.html
Copyright © 2011-2022 走看看