Hash Table - 3. 36. 49. 94. 136. 138. 166.187重做（1.18在Array中做过）

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.

提示：方法一：vector<int> dict(256, -1) 时间复杂度较低

           方法二： unordered_map， start =max(), maxLen = max()

答案：

int lengthOfLongestSubstring(string s) {
        vector<int> dict(256, -1);
        int maxLen = 0, start = -1;
        for (int i = 0; i != s.length(); i++) {
            if (dict[s[i]] > start)
                start = dict[s[i]];
            dict[s[i]] = i;
            maxLen = max(maxLen, i - start);
        }
        return maxLen;
    }

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        unordered_map<char, int> charMap;
        int start = -1;
        int maxLen = 0;
        for(int i = 0; i < s.size(); i++){
            if(charMap.count(s[i]) != 0) start = max(start, charMap[s[i]]);
            charMap[s[i]] = i;
            maxLen = max(maxLen, i - start);
        }
        return maxLen;
    }
};

36. Valid Sudoku

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

1. Each row must contain the digits