文章
[leetcode] 403. Frog Jump
链接描述leetcode题目。有点类似于jumpgame,只不过这里对步数有了隐形的要求,当前步数和之前步数有关。如果我们用bruteforce的方法来解,每一步有三种可能,一共n个石头,时间复杂度就是O(3^n)。这其中有很多步数是多余的,第i个石头无法从任何一个石头
[leetcode]Longest Valid Parentheses
LongestValidParentheses<blockquote<pGivenastringcontainingjustthecharacters&39;(&39;and&39;)&39;,findthelengthofthelonge
[leetcode] Climbing Stairs
70.ClimbingStairs<blockquote<pYouareclimbingastaircase.Ittakesnstepstoreachtothetop.<br/Eachtimeyoucaneitherclimb
[Android] 在xml中“直接”使用px的小技巧和工具
原文链接:在xml中“直接”使用px的小技巧和工具(https://link.segmentfault.com/?encFj926zVQpOlSWmT7nq%2Fmpw%3D%3D.jcy2%2BvcUNMGcrnNG4vTiKtkXGMEj%2BaDAd8Hprb8Db325B6z3A%2F
[LeetCode] 238. Product of Array Except Self
ProblemGivenanarrayofnintegerswheren>1,nums,returnanarrayoutputsuchthatoutputiisequaltotheproductofalltheelements
368. Largest Divisible Subset
题目:Givenasetofdistinctpositiveintegers,findthelargestsubsetsuchthateverypair(Si,Sj)ofelementsinthissubsetsatisfies:Si%Sj0
[LeetCode] House Robber I II
HouseRobberIProblemYouareaprofessionalrobberplanningtorobhousesalongastreet.Eachhousehasacertainamountofmoneystashe
Distinct Subsequences leetcode
<blockquote<pGivenastringSandastringT,countthenumberofdistinct<br/subsequencesofTinS.</p<pAsubsequenceofastringisanewst
Interleaving String leetcode
<blockquote<pGivens1,s2,s3,findwhethers3isformedbytheinterleavingofs1<br/ands2.</p<pForexample,Given:s1&34;aabcc&34;,s2
Triangle leetcode
Triangle<blockquote<pre<codeGivenatriangle,findtheminimumpathsumfromtoptobottom.Eachstepyoumaymovetoadjacentnumberson
已加载文章中没有匹配内容,试试其他关键词或清空搜索。