文章
95. Unique Binary Search Trees II
Givenanintegern,generateallstructurallyuniqueBST&39;s(binarysearchtrees)thatstorevalues1...n.Example:<pre<codeInput:3Output
96. Unique Binary Search Trees
Givenn,howmanystructurallyuniqueBST&39;s(binarysearchtrees)thatstorevalues1...n?Example:<pre<codeInput:3Output:5Explanation
98. Validate Binary Search Tree
Givenabinarytree,determineifitisavalidbinarysearchtree(BST).AssumeaBSTisdefinedasfollows:Theleftsubtreeofanodecontainsonlyn
114. Flatten Binary Tree to Linked List
Givenabinarytree,flattenittoalinkedlistinplace.Forexample,giventhefollowingtree:<pre<code1/\25/\\34
leetcode393. UTF-8 Validation
题目要求<pre<codeAcharacterinUTF8canbefrom1to4byteslong,subjectedtothefollowingrules:For1bytecharacter,thefirstbitisa0
LeetCode 310. Minimum Height Trees
DescriptionForanundirectedgraphwithtreecharacteristics,wecanchooseanynodeastheroot.Theresultgraphisthenarootedtree.Among
116. Populating Next Right Pointers in Each Node
Youaregivenaperfectbinarytreewhereallleavesareonthesamelevel,andeveryparenthastwochildren.Thebinarytreehasthefollowingdefin
117. Populating Next Right Pointers in Each Node II
Givenabinarytree<pre<codestructNode{intval;Nodeleft;Noderight;Nodenext;}</code</prePopulateeachnextpointertopoi
131. Palindrome Partitioning
Givenastrings,partitionssuchthateverysubstringofthepartitionisapalindrome.Returnallpossiblepalindromepartitioningofs.Example:<
leetcode398. Random Pick Index
题目要求<pre<codeGivenanarrayofintegerswithpossibleduplicates,randomlyoutputtheindexofagiventargetnumber.Youcanassumethatthe
已加载文章中没有匹配内容,试试其他关键词或清空搜索。