Longest Substring Without Repeating Characters

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.

想了半天才想明白，这个题目啥意思。

就是说字符串中找一个没有一个字符是重复的最长的子字符串。比如说abcabcbb. 子字符串abc不重负，再加下一个a的话 就重复了。

下面这段代码 没有考虑效率问题

       public static int lengthOfLongestSubstring(String s) {
             int max = 0;
             String temp = "";
             char[] str = s.toCharArray();
             for(int i = 0; i < str.length; i++)
             {

                 if(temp.contains((str[i] + "").trim()))
                 {
                     temp = temp.substring(temp.indexOf(str[i]) + 1); 如果有重复的，就从重复的地方开始。
                 }
                  temp += str[i];
                  if(temp.length() > max)
                  {
                      max = temp.length();
                  }

             }
             return max;
         }