LeetCode 算法学习(2)

题目描述

Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Example 1:

Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.

Example 2:

Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.

Example 3:

Input: “pwwkew”
Output: 3
Explanation: 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.

题目大意

求最长无重复元素的子串。

思路分析

采用动态规划的思想，在遍历到出现重复元素时，转到该重复元素第一次出现的位置继续查找。时间复杂度为O(n),空间复杂度为O(1)。

关键代码

    int lengthOfLongestSubstring(string s) {
        int n = s.length();
        bitset<256> repeated;
        int i = 0, j = 0;
        int max = 0, temp = 0;
        while(i < n && j < n) {
            if (!repeated.test((int)s[j])) { // 在未出现重复元素时继续向后遍历
                repeated.set((int)s[j++]);
                temp = repeated.count();
                max = (max > temp) ? max : temp;
            } else { // 出现重复元素时将从字串的开头位置到重复元素第一次出现的位置间的元素排除出集合
                repeated.reset((int)s[i++]);
            }
        }
        return max;
    }

总结

这是一道比较经典的动态规划问题，一边遍历一边寻找，类似的还有KMP算法匹配字串等，使用类似的思想可以快速的解决一些问题。