(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.

解题思路：

设置子串初始位置为idx=-1；
记录所有字符位置的数组locs[256]初始化-1。
遍历字符串。
for(each ch in s)
{

• locs[ch] = ch.index;
• ch不是首次出现，且locs[ch]>idx

• if( (i-idx)>max )
  max = i - idx;

  }

public int lengthOfLongestSubstring(String s) {
        int locs[] = new int[256];//保存字符上一次出现的位置
        for (int i = 0; i < 256; i++)
            locs[i] = -1;

        int idx = -1, max = 0;//idx为当前子串的开始位置-1
        for (int i = 0; i < s.length(); i++)
        {
            if (locs[s.charAt(i)] > idx)//如果当前字符出现过，那么当前子串的起始位置为这个字符上一次出现的位置+1
            {
                idx = locs[s.charAt(i)];
            }

            if (i - idx > max)
            {
                max = i - idx;
            }

            locs[s.charAt(i)] = i;
        }
        return max;
    }