TIL1_LeetCode: Longest Substring Without Repeating Characters

Given a string s, find the length of the longest substring without repeating characters

Example 1
Input: s = "abcabcbb"
Output:3
Explanation: The answer is "abc", with the length of 3.

Example 2

Input:s="bbbbb"
Output:1
Explanation: The answer is "b", with the length of 1.

Example 3

Input: s = "pwwkew"
Output:3
Explanation:The answer is "wke",with the length of 3.

===========================>

var lengthOfLongestSubstring =function(s){
  let i =0, j=0;
  let maxLen = 0;
  while (j < s.length){
    //while문은 j가 s의 길이보다 작을 때까지 반복한다.
    let k = j - 1;
    while(k>=i) {
      if(s[k]===s[j]){
        i = k+1;
        break;
      }
      k --;
    }
    j++;
    const len = j-i;
    maxLen = maxLen>len ? maxLen : len;
  }
  return maxLen;
};