LeetCode5. The longest loop substring JavaScript

LeetCode5. The longest loop substring JavaScript

Given a string s, find the longest subroutine in s. You can assume that the maximum length of s is 1000. Example 1:

Input: “babad” Output: “bab” Note: “ABA” is also a valid answer.

Example 2:

Input: “CBBD” Output: “bb”

/** * @param {string} s * @return {string} */
var longestPalindrome = function(s) {
    let palindromes = [];

    if(s.length <= 1) {
        return s;
    }

    for (var i = 0; i < s.length; i += 1) {
      j = 0;
      k = 0;
      while(s[i + j] === s[i - j] && s[i + j] && s[i - j]) {
        j++;
      };
      palindromes.push(s.slice(i-(j- 1), i+j)) //even palindromes
      j = 0;

      while(s[(i + 1) + k] === s[i - k] && s[(i + 1) + k] && s[i - k]){
        k++;
      }
      palindromes.push(s.slice(i-(k- 1),(i+1)+k)) //odd palindromes
      k = 0;
    }
    return palindromes.sort((a, b) = > {
        return b.length - a.length
    })[0];

};
Copy the code