leetcode 3. Longest Substring Without Repeating Characters

3. Longest Substring Without Repeating Characters

 

Question Editorial Solution

  My Submissions

• Total Accepted: 184514
• Total Submissions: 798932
• 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.

本题的具体思路是如果碰到相同的字符，就从该字符上一次出现的下一个位置开始重新计算。

这里定义个start属性，表示起始下标，一个arr数组，存储每个字符上一次出现的位置，初始值都为-1.

public class Solution {
    public int lengthOfLongestSubstring(String s) {
          int[] arr = new int[256];
		  char[] str = s.toCharArray();
		  Arrays.fill(arr, -1);
		  int start = -1;
		  int ans = 0;
		  for(int i = 0; i < str.length;i++){
		     //这一步蕴含了很多，即使str[i]在前面出现过，但如果上一次出现的位置arr[str[i]]在
		     //子串初始位置start的前面，即小于start，则认为str[i]没有出现过，即不做处理
			 if(arr[str[i]] > start){
				 start = arr[str[i]]+1;
			 }
			 if(i- start +1> ans){
				 ans = i - start+1;
			 }
			 arr[str[i]] = i;
		  }
		
		  return ans;
    }
}