LeetCode-3 Longest Substring Without Repeating Characters(最长无重复子串)

LeetCode-3 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 3. For "bbbbb" the longest substring is "b", with the length of 1.

JAVA:

import java.util.Arrays;

public class Solution {
	public static int lengthOfLongestSubstring(String s) {
		int[] zimu = new int[1000];
		int max = 0;
		int start = 0;//记录起点位置
		Arrays.fill(zimu, -1);
		for (int i = 0; i < s.length(); i++) {
			if (zimu[s.charAt(i)] >= start) {
				max = Math.max(i - start, max);
				start = zimu[s.charAt(i)] + 1;//出现重复时，从重复点下一个位置作为初始点继续往下。
			}
			zimu[s.charAt(i)] = i;
		}
		return Math.max(s.length() - start, max);//结尾的情况。eg：“abcd”
	}
}

Runtime: 277ms

 分析：

比较关键的地方是记录起点位置，每次存进数组的内容都是元素出现的位置，然后在重复出现时，直接将新的位置减去数组内容，就能得到一个长度。然后将数组内存放的位置信息作为新的起点，然后继续遍历.......