《leetcode》longest-substring-without-repeating

题目描述

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.

解析：题目的意思是求最大不重复的连续的子串，注意字符不能再前面重复。

public class Solution {public int lengthOfLongestSubstring(String s) {int max=0;for(int i=0;i<s.length();i++){int count=1;//当前字符计数1次for(int j=i+1;j<s.length();j++){int start=i;boolean flag=false;while (start<j){if(s.charAt(j)==s.charAt(start)){flag=true;break;}start++;}if(!flag){//在之前的字符串里没有出现过count++;}else {//出现后就没必要继续了break;}}if(count>=max){max=count;}}return max;}
}

《leetcode》longest-substring-without-repeating相关推荐

【贪心】LeetCode 3. Longest Substring Without Repeating Characters
LeetCode 3. Longest Substring Without Repeating Characters Solution1:我的答案该方法中哈希表记录的是字符出现的次数.标准的贪心算法 ...
[LeetCode]3.Longest Substring Without Repeating Characters
[题目] Given a string, find the length of the longest substring without repeating characters. For exam ...
LeetCode:3. Longest Substring Without Repeating Characters
https://leetcode.com/problems/longest-substring-without-repeating-characters/description/ 内容描述: Give ...
LeetCode 3. Longest Substring Without Repeating Characters-- c++,java,python解法
题目地址: Given a string, find the length of the longest substring without repeating characters. Example ...
[LeetCode]--3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Examples: Giv ...
leetcode 3. Longest Substring Without Repeating Characters 最长非重复子串的长度滑动窗口法
题目链接根据我们之前介绍的滑动窗口法的解法: 滑动窗口法详解 leetcode 438. Find All Anagrams in a String 滑动窗口法这题,我们不难解决,使用之前的模板. ...
python刷leetcode_零基础python刷leetcode -- 3. Longest Substring Without Repeating Characters
算法很重要,但是每天也需要学学python,于是就想用python刷leetcode 的算法题,和我一起开始零基础python刷leetcode之旅吧.如有不对的地方,希望指正,万分感谢~~ 题目最 ...
leetcode 3. Longest Substring Without Repeating Characters | 3. 无重复字符的最长子串（双指针+滑窗）
题目 https://leetcode.com/problems/longest-substring-without-repeating-characters/ 题解双指针+滑窗,维护一个 set, ...
LeetCode 3 Longest Substring Without Repeating Characters 区间,想法难度:1
https://leetcode.com/problems/longest-substring-without-repeating-characters/ 思路:从某点结束所能取到的最早开头是到目前出 ...
leetcode 3. Longest Substring Without Repeating Characters
记得这要+1,j = std::max(j,container[s[i]]+1); class Solution { public:int lengthOfLongestSubstring(strin ...

《leetcode》longest-substring-without-repeating

《leetcode》longest-substring-without-repeating相关推荐

最新文章

热门文章