算法分析与设计第十三周作业

最新推荐文章于 2022-12-23 09:58:52 发布

jjkhhu

最新推荐文章于 2022-12-23 09:58:52 发布

阅读量254

点赞数

分类专栏：个人作业

本文链接：https://blog.csdn.net/jjkhhu/article/details/84729233

版权

个人作业专栏收录该内容

19 篇文章 0 订阅

订阅专栏

算法分析与设计第十三周作业

题目

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.

题目传送门

解答

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int m[256] = {0}, res = 0, left = 0;
        for (int i = 0; i < s.size(); ++i) {
            if (m[s[i]] == 0 || m[s[i]] < left) {
                res = max(res, i - left + 1);
            } else {
                left = m[s[i]];
            }
            m[s[i]] = i + 1;
        }
        return res;
    }
};

解答详情传送门