zoukankan      html  css  js  c++  java
  • leetCode刷题(找到最长的回文字符串)

    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 subsequenceand not a substring.

    /**
     * @param {string} s
     * @return {string}
     */
    var longestPalindrome = function(s) {
      var maxLength="";
      var maxPalindrome="";
      for(index=0;index<s.length;index++){
          var strOdd=getPalindromeLength(index,index,s);
          var strEven=getPalindromeLength(index,index+1,s);
          var strOddLength=strOdd.length;
          var strEvenLength=strEven.length;
          if(maxLength<strOddLength){
              maxLength=strOddLength;
              maxPalindrome=strOdd;
          }
          if(maxLength<strEvenLength){
              maxLength=strEvenLength;
              maxPalindrome=strEven;
          }
      }
      function getPalindromeLength(start,end,Palindrome){
          while((start>=0)&&(end<Palindrome.length)&&(Palindrome[start]==Palindrome[end])){
                start--;
                end++;
          }
          return Palindrome.substring(start+1,end);
      }
      return maxPalindrome
    };
    

      

      

    学而不思则罔,思而不结则殆,结而不看,一事无成
  • 相关阅读:
    ffmpeg参数说明
    【FFmpeg】FFmpeg常用基本命令
    ffmpeg最全的命令参数
    数据库总结
    linux redis安装及JAVA使用jedis
    记录一次工作中jvm被linux杀死的调查
    ExecutorService线程池submit的使用
    java四种引用与回调函数
    java排序
    NIO教程笔记
  • 原文地址:https://www.cnblogs.com/windseek/p/8657977.html
Copyright © 2011-2022 走看看