文章
【Leetcode】109.有序链表转换二叉搜索树
题目给定一个单链表,其中的元素按升序排序,将其转换为高度平衡的二叉搜索树。本题中,一个高度平衡二叉树是指一个二叉树每个节点的左右两个子树的高度差的绝对值不超过1。示例:给定的有序链表:10,3,0,5,9,一个可能的答案是:0,3,9,1
LeetCode 331. Verify Preorder Serialization of a Binary Tree
DescriptionOnewaytoserializeabinarytreeistousepreordertraversal.Whenweencounteranonnullnode,werecordthenode&39;svalue.
Leetcode PHP题解--D7 905. Sort Array By Parity
905.SortArrayByParity题目链接905.SortArrayByParity(https://link.segmentfault.com/?enc1Rsx5vXMEtYqjYZgjlAgOQ%3D%3D.%2F%2BImbfgQh11
【Leetcode】107. 二叉树的层次遍历 II
题目给定一个二叉树,返回其节点值自底向上的层次遍历。(即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)例如:给定二叉树3,9,20,null,null,15,7,<pre<code3/\920/\157
Leetcode PHP题解--D6 595. Big Countries
595.BigCountries题目链接595.BigCountries(https://link.segmentfault.com/?enc6iCkY2oS3DHDHPZv4EHF3g%3D%3D.YrcnIiw%2F779NoVG1mVyEU%2Byik3
LeetCode 330. Patching Array
DescriptionGivenasortedpositiveintegerarraynumsandanintegern,add/patchelementstothearraysuchthatanynumberinrange1,ninc
Leetcode PHP题解--D5 804. Unique Morse Code Words
804.UniqueMorseCodeWords题目链接804.UniqueMorseCodeWords(https://link.segmentfault.com/?encYbAHIVtthBid2o5ZJ%2FyOXQ%3D%3D.xpb9ZlF
小李飞刀:做题第七弹!
写在前面的话做做做题,慢慢上手了就觉得刷题速度变快了,果然还是有点笨~希望最后一窍快点通吧~开始做题第一题169.求众数(https://link.segmentfault.com/?encMR3kRYMRf2GK4zEx
leetcode406. Queue Reconstruction by Height
题目要求<pre<codeSupposeyouhavearandomlistofpeoplestandinginaqueue.Eachpersonisdescribedbyapairofintegers(h,k),wherehis
leetcode419. Battleships in a Board
题目要求<pre<codeGivenan2Dboard,counthowmanybattleshipsareinit.Thebattleshipsarerepresentedwith&39;X&39;s,emptyslotsarerepr
已加载文章中没有匹配内容,试试其他关键词或清空搜索。