您當前位置：首頁 > php開源 > php教程 > LeetCode:Longest Substring Without Repeating Characters

LeetCode:Longest Substring Without Repeating Characters

來源：程序員人生發布時間：2016-06-13 11:00:46 閱讀次數：2452次

Longest Substring Without Repeating Characters

Total Accepted: 152787 Total Submissions: 687012 Difficulty: Medium

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.

Subscribe to see which companies asked this question

Hide Tags

Hash Table Two Pointers String

Hide Similar Problems

(H) Longest Substring with At Most Two Distinct Characters

思路：

保護1個HashMap存儲每一個字符的位置；兩個指針i,j，保護最長子串的范圍。

java code:

public class Solution { public int lengthOfLongestSubstring(String s) { if(s==null || s.length()==0) return 0; Map<Character, Integer> map = new HashMap<Character, Integer>(); int max = 0; for(int i=0,j=0;i<s.length();i++) { char c = s.charAt(i); if(map.containsKey(c)) { j = Math.max(j, map.get(c)+1); } map.put(c, i); max = Math.max(max, i-j+1); } return max; } }

生活不易，碼農辛苦
如果您覺得本網站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
程序員人生

------分隔線----------------------------

上一篇 mongodb3.0的索引管理學習整理

下一篇 Python機器視覺編程環境搭建方法

分享到:

------分隔線----------------------------

為碼而活

積分：4237

15粉絲

7關注

欄目熱點

多多色-多人伦交性欧美在线观看-多人伦精品一区二区三区视频-多色视频-免费黄色视屏网站-免费黄色在线

LeetCode:Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters