Longest Substring Without Repeat Characters

最新推荐文章于 2020-07-22 22:34:18 发布
最新推荐文章于 2020-07-22 22:34:18 发布
阅读量110 收藏
点赞数
原文链接：http://www.cnblogs.com/HuoAA/p/5074246.html
版权 
 1 var lengthOfLongestSubstring = function(s) {
 2     if (s === '') {  3 return 0;  4  }  5  6 var lenMax = 1,  7 lenCurr = 1,  8  i, repeat;  9 10 for (i = 1; i < s.length; i++) { 11 repeat = s.substr(i - lenCurr, lenCurr).indexOf(s.substr(i, 1)); 12 13 if (repeat == -1) { 14 lenCurr++; 15 } else { 16 lenCurr -= repeat; 17  } 18 19 if (lenCurr > lenMax) { 20 lenMax = lenCurr; 21  } 22  } 23 24 return lenMax; 25 };

 

转载于:https://www.cnblogs.com/HuoAA/p/5074246.html

aejt95023
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
LeetCode 3. Longest Substring Without Repeating Characters--不包含重复字符的最长子串长度(不重复最长子串)
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
08-07 474
Given a string, find the length of thelongest substringwithout repeating characters. Examples: Given"abcabcbb", the answer is"abc", which the length is 3. Given"bbbbb", the answer is"b",
LeetCode3 Longest Substring Without Repeating Characters
01-09
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...
Leetcode 3 Longest Substring Without Repeat... 最长无重复子串
weixin_33738982的博客
12-21 239
Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer ...
每日算法之三：Longest Substring Without Repeating Characters
yapian8的专栏
04-02 932
题目要求： 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
LeetCode 3: Longest Substring Without Repea (JAVA)
weixin_34293059的博客
04-06 106
为什么80%的码农都做不了架构师？>>> ...
Longest Substring Without Repeating Characters: 12ms
小小程序员
07-02 668
class Solution { public: int lengthOfLongestSubstring(string s) { int hash[256] = {0}; int len = s.size(); if (len <= 0) return 0; int maxLen = -1, curL
longest-substring-without-repeating-characters
03-29
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...
js代码-3. Longest Substring Without Repeating Characters
07-16
Longest Substring Without Repeating Characters" 描述的是一个经典的计算机编程问题，通常出现在面试或编程竞赛中。这个题目要求我们找到一个字符串中最长的子串，该子串中没有重复的字符。这是一个非常基础但又...
LeetCode5 Longest Palindromic Substring
01-09
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Java AC 版本
3 最长不重复子串Longest Substring Without Repeating Characters算法优化
对酒当歌，人生几何。譬如朝露，去日苦多
07-22 213
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"
双指针+哈希表类题目Longest Substring Without Repeating Charac Longest Substring Without Repeating Characters
yanglq的博客
09-04 245
76. Minimum Window Substring Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T =
leetcode：Longest Substring Without Repeating Characters （寻找最长无重复字符的子串）
liujiangangpeng的专栏
03-13 599
题目： 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
Longest Substring Without Repeating Characters -- LeetCode
编程语言小筑
02-26 178
原题链接:http://oj.leetcode.com/problems/longest-substring-without-repeating-characters/这道题用的方法是在LeetCode中很常用的方法，对于字符串的题目非常有用。 首先brute force的时间复杂度是O(n^3), 对每个substring都看看是不是有重复的字符，找出其中最长的，复杂度非常高。优化一些的思路是稍...
Longest Substring Without Repeating Characters题目及解法
刘天的博客
02-21 347
问题描述： Given a string, find the length of the longest substring without repeating characters. 示例： Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b",
【LeetCode题解】3_无重复字符的最长子串（Longest-Substring-Without-Repeating-Characters）
StrongXGP 的博客
12-11 220
更多 LeetCode 题解笔记可以访问我的 github。 文章目录描述解法一：暴力枚举法（Time Limit Exceeded）思路Java 实现Python 实现复杂度分析解法二：滑动窗口（双指针）思路Java 实现Python 实现复杂度分析解法三：滑动窗口（优化版）思路Java 实现Python 实现复杂度分析解法四：滑动窗口（已知字符集）思路Java 实现Python 实现复杂度...
Longest Substring Without Repeating Characters
qq_39613584的博客
01-03 132
Longest Substring Without Repeating CharactersDescription Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which th
LeetCode(3)-Python-无重复字符的最长子串(longest-substring-without-repeating-characters)
Paul_wang的博客
01-16 304
题目描述 给定一个字符串，请你找出其中不含有重复字符的 最长子串 的长度。 示例 1: 输入: “abcabcbb” 输出: 3 解释: 因为无重复字符的最长子串是 “abc”，所以其长度为 3。 示例 2: 输入: “bbbbb” 输出: 1 解释: 因为无重复字符的最长子串是 “b”，所以其长度为 1。 示例 3: 输入: “pwwkew” 输出: 3 解释: 因为无重复字符的最长子串是 “w...
没有重复字符的最长子字符串(Longest Substring Without Repeating Characters)
K.Sun
10-12 458
Given a string, find the length of the longest substring without repeating characters.
【贪心算法】Longest Substring Without Repeating Characters
bupt8846的专栏
03-29 855
题目：leetcode Longest Substring Without Repeating Characters Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repea
Given a string s, find the length of the longest substring without repeating characters.
最新发布
06-03
To find the length of the longest substring without repeating characters, we can use the sliding window approach. Here's the algorithm: 1. Initialize a set to store the unique characters in the current window, and two pointers left and right to mark the current window. 2. Initialize a variable max_len to 0 to store the length of the longest substring without repeating characters. 3. While the right pointer is less than the length of the string s: - If the character at s[right] is not in the set, add it to the set and move the right pointer to the right. - Else, remove the character at s[left] from the set and move the left pointer to the right. 4. Update the value of max_len with the maximum of its current value and the size of the set. 5. Return max_len. Here's the Python code for the algorithm: ``` def longest_substring(s): unique_chars = set() left = 0 max_len = 0 for right in range(len(s)): while s[right] in unique_chars: unique_chars.remove(s[left]) left += 1 unique_chars.add(s[right]) max_len = max(max_len, len(unique_chars)) return max_len ``` Example usage: ``` s = "abcabcbb" print(longest_substring(s)) # Output: 3 (for "abc") ```

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值