LeetCode3. Longest Substring Without Repeating Characters

一、题目说明：

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given “abcabcbb”, the answer is “abc”, which the length is 3.

Given “bbbbb”, the answer is “b”, with the length of 1.

Given “pwwkew”, 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.

---

二、思路

本人在网上看到了如下的提示图，很直观、容易理解，按照进行编程实现即可。感谢网络分享（没有找到最源头，直接转载过来分享了）。

---

三、C#程序解法

供参考：

class Program
{
    public static int LengthOfLongestSubstring(string s)
    {
        int lengh = s.Length;
        if (s == null || lengh == 0)
        {
            return 0;
        }
        char[] testStr = s.ToArray();
        int start = 0;
        int end = 0;
        int max = 0;
        Dictionary<char, int> dict = new Dictionary<char, int>();

        while (end < lengh)
        {
            if (dict.ContainsKey(testStr[end]))
            {
                max = Math.Max(max, end - start);
                start = dict[testStr[end]] + 1;
                dict.Clear();
                for (int i = start; i <= end; i++)
                {
                    dict.Add(testStr[i], i);
                }
            }
            else
            {
                max = Math.Max(max, end - start + 1);
                dict.Add(testStr[end], end);
            }

            end++;
        }

        return max;
    }

    static void Main(string[] args)
    {
        string a = "bbtablud";
        int num = LengthOfLongestSubstring(a);
    }
}

END.