// Dynamic programming longest palindrome substring // Boolean type t [i] [j] represents the substring (s (i .... j)) whether the palindrome substring // Where t [i] [j] value by t [i+ 1] [j-1] value and is s [i] and s [j] is equal to the judgment (ie substring (s (i. ..j)) whether it is a palindrome substring problem by sub-s (i+ 1, ..., j-1) whether it is a palindrome string to resolve) // To indicate the current longest palindrome substring index by left and right

leetcode_Longest Palindromic Substring\Debug\leetcode_Longest Palindromic Substring.exe
......................................\.....\leetcode_Longest Palindromic Substring.ilk
......................................\.....\leetcode_Longest Palindromic Substring.pdb
......................................\ipch\leetcode_longest palindromic substring-92f9159f\leetcode_longest palindromic substring-5683315f.ipch
......................................\leetcode_Longest Palindromic Substring\Debug\CL.read.1.tlog
......................................\......................................\.....\CL.write.1.tlog
......................................\......................................\.....\leetcode_Longest Palindromic Substring.lastbuildstate
......................................\......................................\.....\leetcode_Longest Palindromic Substring.log
......................................\......................................\.....\leetcode_Longest Palindromic Substring.obj
......................................\......................................\.....\leetcode_Longest Palindromic Substring.pch
......................................\......................................\.....\link-cvtres.read.1.tlog
......................................\......................................\.....\link-cvtres.write.1.tlog
......................................\......................................\.....\link-rc.read.1.tlog
......................................\......................................\.....\link-rc.write.1.tlog
......................................\......................................\.....\link.read.1.tlog
......................................\......................................\.....\link.write.1.tlog
......................................\......................................\.....\stdafx.obj
......................................\......................................\.....\vc110.idb
......................................\......................................\.....\vc110.pdb
......................................\......................................\leetcode_Longest Palindromic Substring.cpp
......................................\......................................\leetcode_Longest Palindromic Substring.vcxproj
......................................\......................................\leetcode_Longest Palindromic Substring.vcxproj.filters
......................................\......................................\ReadMe.txt
......................................\......................................\stdafx.cpp
......................................\......................................\stdafx.h
......................................\......................................\targetver.h
......................................\leetcode_Longest Palindromic Substring.sdf
......................................\leetcode_Longest Palindromic Substring.sln
......................................\leetcode_Longest Palindromic Substring.v11.suo
......................................\ipch\leetcode_longest palindromic substring-92f9159f
......................................\leetcode_Longest Palindromic Substring\Debug
......................................\Debug
......................................\ipch
......................................\leetcode_Longest Palindromic Substring
leetcode_Longest Palindromic Substring
......................................\readme.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．