Longest Substring Without Repeating Characters – Algorithm JavaScript – Medium

1.Description

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.

2.Solution

My algorithm

Chưa nghĩ ra

Optimal Solution

var lengthOfLongestSubstring = function (s) {
  var k = 0;
  var maxLength = 0;
  for (i = 0; i < s.length; i++) {
    for (j = k; j < i; j++) {
      if (s[i] === s[j]) {
        k = j + 1;
        break;
      }
    }
    if (i - k + 1 > maxLength) {
      maxLength = i - k + 1;
    }
  }
  return maxLength;
};