LeetCode---------Longest Substring Without Repeating Characters解法

题目如下：

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 the length of 1.

Given "pwwkew", 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.

大致翻译：

给出一个字符串，求出没有重复字符的最长子串的长度。

例如：

给出"abcabcbb",答案是"abc"的长度为3.

给出"bbbbb",答案是"b"的长度为1.

给出"pwwkew",答案是"wke"的长度为3. 注意答案必须是一个子串，"pwke"是一个子序列但并不是子串.

本题重点在于不重复的子串，想到HashSet是不允许存储重复的数据的，所以解法就利用HashSet来实现。

【Java代码】

public class Solution {public int lengthOfLongestSubstring(String s) {//不重复子串的长度int length = 0;//构造不重复的set表Set<Character> set = new HashSet<Character>();int i = 0, j = 0;for(i = 0; i < s.length(); i++){set.clear();//清空set表set.add(s.charAt(i));//加入开始字符for(j = i + 1; j < s.length(); j++){if(set.add(s.charAt(j)));//如果成功加入，证明没有重复，程序继续else break;//如果没成功加入，则跳出}if(j - i >= length) length = j - i;//计算长度并保留最长长度}return length;}
}

如果有任何问题，欢迎跟我联系：xiaomenxiaomen@qq.com

我的github地址：github.com/WXRain

转载于:https://www.cnblogs.com/srain/p/6877746.html

LeetCode---------Longest Substring Without Repeating Characters解法相关推荐

LeetCode——Longest Substring Without Repeating Characters
原问题 Given a string, find the length of the longest substring without repeating characters. Example 1 ...
LeetCode Longest Substring Without Repeating Characters
题意 Given a string, find the length of the longest substring without repeating characters. For exampl ...
[LeetCode] Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, ...
LeetCode: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)
这是悦乐书的第341次更新,第365篇原创 01 看题和准备今天介绍的是LeetCode算法题中Medium级别的第2题Longest Substring Without Repeating Cha ...
[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)
LeetCode 第 3 题(Longest Substring Without Repeating Characters) Given a string, find the length of th ...
leetcode（三）—— Longest Substring Without Repeating Characters（最长不重复子串 Python/C++）
Longest Substring Without Repeating Characters | LeetCode OJ 使用 hash 判重问题首先想到的就是 hash(或者使用 map): 思路: ...
【贪心】LeetCode 3. Longest Substring Without Repeating Characters
LeetCode 3. Longest Substring Without Repeating Characters Solution1:我的答案该方法中哈希表记录的是字符出现的次数.标准的贪心算法 ...

LeetCode---------Longest Substring Without Repeating Characters解法

LeetCode---------Longest Substring Without Repeating Characters解法相关推荐

最新文章

热门文章