Longest Substring Without Repeat

题目

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.

作答

js

/**
 * @param {string} s
 * @return {number}
 */
var lengthOfLongestSubstring = function(s) {
      var resultStr="",maxLength = 0 ,currentCount = 0;
        for(var i = 0 ;i<s.length ;i++){
             for(var j = i ;j < s.length; j++){
                      if(resultStr.indexOf(s[j])===-1){
                            currentCount++;
                            resultStr +=s[j]
                            maxLength = currentCount > maxLength ? currentCount : maxLength
                      }else{
                        //记录当前长度
                          maxLength = currentCount > maxLength ? currentCount : maxLength
                          //重置
                          resultStr = "";
                          currentCount = 0 ;
                          //跳出当前位置继续寻找
                          break;
                      }
             }
        }
        return maxLength
};