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
    };
    

      

      

    学而不思则罔,思而不结则殆,结而不看,一事无成
  • 相关阅读:
    iOS 自带系统语音识别
    对iOS10新增Api的详细探究
    iOS 技术前瞻
    iOS 之 byte NSString NSData类型转换
    iOS 文本属性
    基本力
    xamarin mac 基础知识 之 界面
    xamarin mac 之 基础知识
    xamarin mac 之 资料
    I方法 thinkphp
  • 原文地址:https://www.cnblogs.com/windseek/p/8657977.html
Copyright © 2011-2022 走看看