LeetCode_3、5两题（substring问题）

LeetCode_3. 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.

解析：除了没有相同字符的情况，两个相邻相同字符之间的长度为最长距离。我们知道字符一共有256种，我们可以进行一次遍历，每当遇到一个字符时，看它之前的相同的字符在什么位置，如果他们之间的距离大于当前最长距离，就可以替换当前最大距离。具体方法思想就是这样，所以创建一个表记录每个字符先前出现的位置（初始化为-1），当遍历到这个字符时，替换表中这个字符的位置号码。

class Solution {
public:
    int lengthOfLongestSubstring(