LeetCode #3 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.

    var s="pwwkew";
    var arr=[];
    var norepeatarr=[];
    for(var i= 0;i<s.length;i++) {
        for (var j = i + 1; j < s.length; j++) {
            arr.push(s.substring(i, j));
        }
    }
    console.log(arr);
    for(var m=0;m<arr.length;m++){
        for(var s of arr[m]){
            if(arr[m].indexOf(s)==arr[m].lastIndexOf(s));
        };
    }

LeetCode #3 Longest Substring Without Repeating Characters

标签：

原文地址：http://www.cnblogs.com/carlyin/p/5852361.html