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.
相关阅读: 贪心算法详解 http://blog.csdn.net/liangbopirates/article/details/10044463 动态规划DP持续分析(update) http://blog.csdn.net/liangbopirates/article/details/9393161