首页 > 代码库 > LeetCode #3 Longest Substring Without Repeating Characters
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)); }; }
to be continued...
LeetCode #3 Longest Substring Without Repeating Characters
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。