文章
115 Distinct Subsequences
<pre<codeGivenastringSandastringT,countthenumberofdistinctsubsequencesofTinS.Asubsequenceofastringisanewstringwhichisf
97 Interleaving String
<pre<codeGivens1,s2,s3,findwhethers3isformedbytheinterleavingofs1ands2.Forexample,Given:s1&34;aabcc&34;,s2&34;dbbca&3
10 Regular Expression Matching, 填dp table
<blockquote<pImplementregularexpressionmatchingwithsupportfor&39;.&39;and&39;&39;.</p</blockquote<pre<code&39;.&39;Matchesa
72 Edit Distance 以及两个string比较的填表通解。
<blockquote<p72EditDistance</p</blockquote<pre<codeGiventwowordsword1andword2,findtheminimumnumberofstepsrequiredtoconvertwo
[leetcode]132. Palindrome Partitioning II
<blockquote<pGivenastrings,partitionssuchthateverysubstringofthepartitionisapalindrome.Returntheminimumcutsneededforapalindr
[leetcode]85. Maximal Rectangle
<blockquote<pGivena2Dbinarymatrixfilledwith0&39;sand1&39;s,findthelargestrectanglecontainingonly1&39;sandreturnitsarea.<br/
[leetcode]354. Russian Doll Envelopes
<blockquote<pYouhaveanumberofenvelopeswithwidthsandheightsgivenasapairofintegers(w,h).Oneenvelopecanfitintoanotherifandon
[leetcode]Longest Increasing Subsequence
<blockquote<pGivenanunsortedarrayofintegers,findthelengthoflongestincreasingsubsequence.</p<pForexample,Given10,9,2,5,3,7,
[leetcode]174. Dungeon Game
<blockquote<pThedemonshadcapturedtheprincess(P)andimprisonedherinthebottomrightcornerofadungeon.ThedungeonconsistsofMxNroo
[leetcode]321. Create Maximum Number
<blockquote<pGiventwoarraysoflengthmandnwithdigits09representingtwonumbers.Createthemaximumnumberoflengthk<mnfromdi
已加载文章中没有匹配内容,试试其他关键词或清空搜索。