原文:[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 repeating letters for abcabcbb is abc , which the length is . For bbbb ...

2012-11-12 16:21 0 6921 推荐指数:

查看详情

LeetCode——3. Longest Substring Without Repeating Characters

一.题目链接:https://leetcode.com/problems/longest-substring-without-repeating-characters 二.题目大意:   给定一个字符串,返回它最长的无重复的子串的长度。 三.题解   该题目,我用了三种方法: 1.思路 ...

Mon Nov 27 20:59:00 CST 2017 0 1996
 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM