54：最长不含重复字符的子字符串

最长不含重复字符的子字符串

public class Offer54 {
    public static void main(String[] args) {
        System.out.println(new Offer54().LongestSubStringWithoutDuplication("asfahjfabswr"));
    }


    public int LongestSubStringWithoutDuplication(String str) {
        if (str == null || str.length() == 0) return 0;
        int preLength = 0;
        int curLength = 0;
        int maxLength = 0;
        int[] pos = new int[26];
        for (int i = 0; i < pos.length; i++) {
            pos[i] = -1;
        }
        //1. 存在一个26长度的数组来保存a~z字符的上一次出现在str中位置下标
        //2. 判断字符重复出现问题，①：pos数组中的值为-1,未出现过；②：pos数组中的值不为-1，现在出现在str中的下标减去pos数组的下标大于现在子字符串的长度
        //3. 
        for (int i = 0; i < str.length(); i++) {
            // 获取字符的ASCII码
            int letterNumber = str.charAt(i) - 'a';
            //没有出现过 或者 子字符串的长度小于上次出现的距离
            if (pos[letterNumber] < 0 || i - pos[letterNumber] > preLength) {

                curLength = preLength + 1;
            } else {
                curLength = i - pos[letterNumber];
            }
            pos[letterNumber] = i;
            if (curLength > maxLength)
                maxLength = curLength;
            preLength = curLength;
        }


        return maxLength;
    }
}