【LeetCode从零单排（Java）】No3. Longest Substring Without Repeating Characters，leetcoderepeating

【LeetCode从零单排（Java）】No3. Longest Substring Without Repeating Characters，leetcoderepeating

题目： 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.

解法：

public class Solution {
    public int lengthOfLongestSubstring(String s) {
         //参考贪心算法
        int[] array = new int [128];
        int start = 0;
        int length = 0;
        char[] w  = new char[s.length()];
        w = s.toCharArray();
        for (int i=0; i<array.length;i++){
            array[i] = -1;
        }
        for(int i=0; i<s.length();++i){
            if(array[w[i]-' ']>=start){
                if(i-start>length)
                    length = i-start;
                start = array[w[i]-' ']+1;
            }
            array[w[i]-' '] = i;
        }
        if(length>s.length()-start)
            return length;
        else 
            return s.length()-start;

    }
}

效果：runtime beats 91.60% of javasubmissions .