算法分析与设计——LeetCode Problem.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.

---

问题分析及思路

比较基础的最大不重复字符串问题，这里我采用的算法比较简单,直接采用三层循环，前两层确定目前的没有重复的子字符串，第三层循环将下一个字符与目前没有重复的子字符串遍历比较，若有相同的则break，再在外面判断遍历的数是否遍历完以此决定下一步操作。
之后我进行了优化，去掉第三层循环，改为直接用find函数找下一个字符，若没有找到返回-1，则可以进行剩下的操作。

---

具体代码

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        if(s.size() == 0) return 0;
        int i, j;
        int max = 1;
        for(i = 0; i < s.size(); i++) {
            string b = s.substr(i, 1);
            int count = 1;
            for(j = i+1; j < s.size(); j++) {
                if(b.find(s[j]) != -1) break;
                b += s[j];
                count++;
                if(count > max) max = count;
            }
        }
        return max;
    }
};