[leetcode][string] Longest Substring Without Repeating Characters
来源:互联网 发布:卡宾男装淘宝客服电话 编辑:程序博客网 时间:2024/05/16 01:13
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
class Solution {public: int lengthOfLongestSubstring(string s) {if (s.size() <= 1) return s.size();int hashTable[256];memset(hashTable, -1, sizeof(hashTable));//初始化hashTableint maxLen = 0;//最长无重复字符的子串长度int len = 0;//当前无重复字符子串的长度int start = 0;//当前无重复字符子串的开始位置for (int i = 0; i < s.size(); ++i){if (hashTable[s[i]] < 0){len++;hashTable[s[i]] = i;}else{maxLen = len > maxLen ? len : maxLen;//更新最长所求子串长度for (int j = start; j < i && s[j] != s[i]; ++j){ //!!!将出现s[i]前一次出现位置之前出现的字符在hashTable全部更新为未出现过hashTable[s[j]] = -1;}len = i - hashTable[s[i]];//更新当前无重复字符子串的长度(hashTable[s[i]]是上一次字符s[i]出现的位置,所以当前无重复字符子串是从此位置到i)start = hashTable[s[i]]+1;//更新当前无重复字符子串的开始位置的下一个位置hashTable[s[i]] = i;//更新字符是s[i]出现的位置为i}}maxLen = len > maxLen ? len : maxLen;//更新最长所求子串长度(可能还没来得及更新max就到达字符串结尾了)return maxLen;}};
0 0
- [leetcode][string] Longest Substring Without Repeating Characters
- LeetCode-string-Longest Substring Without Repeating Characters
- Leetcode- string/array - Longest Substring Without Repeating Characters
- leetcode 3---Longest Substring Without Repeating Characters 双指针 String
- String-3.Longest Substring Without Repeating Characters
- LeetCode: Longest Substring Without Repeating Characters
- LeetCode Longest Substring Without Repeating Characters
- LeetCode: Longest Substring Without Repeating Characters
- [Leetcode] Longest Substring Without Repeating Characters
- leetcode 23: Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- LeetCode 3 - Longest Substring Without Repeating Characters
- [LeetCode]Longest Substring Without Repeating Characters
- leetcode Longest Substring Without Repeating Characters
- 【leetcode】 Longest Substring Without Repeating Characters
- LeetCode-Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- PPP
- 动态规划要点
- EFM32之外部中断
- HTML5之5 __Canvas: 渐变
- mailcore2教程-1 前言
- [leetcode][string] Longest Substring Without Repeating Characters
- Linux 指定端口开放
- android NDK开发编译C++文件出现Type 'jint' could not be resolved和Unresolved inclusion: <jni.h>的解决办法
- 数值分析4 非线性方程求根
- 小谈粗心的危害
- 黑马程序员学习日记--多线程
- 坑!!关于通知栏中支持自定义布局,不支持自定义控件的问题
- POJ 3660 Cow Contest
- C#连接SQL Server 2012