3. Longest Substring Without Repeating Characters

水题。

class Solution {          
    public:               
        int lengthOfLongestSubstring(string s) {
            char flag[256];
            int length = s.length();
                          
            int result = 0;
            int tmp_ans = 0;
            for (int idx_start = 0; idx_start < length; idx_start++) {
                memset(flag, 0, sizeof(flag));
                tmp_ans = 0;
                for (int idx_end = idx_start; idx_end < length; idx_end++) {
                    if (!flag[s[idx_end]]) {
                        flag[s[idx_end]] = 1;
                        tmp_ans++;
                    } else {
                        break;
                    }        
                }         
                result = tmp_ans > result ? tmp_ans : result;
            }             
                          
            return result;                                                                                                                                                                                          
        }                 
};