文章
leetcode 22 括号生成
22.括号生成(https://link.segmentfault.com/?enci41x2HoP4ik7Oy%2B0sSVL5A%3D%3D.gCRHIh9T7HVV2b8%2B4Qmbz5ziebOX4RjvGEL7g927ETCesSC8kpGbgTH5cVBFoEjhlN%
字节面试
1.字节一面基本面试下面两句话的区别<codeselectfromtwherebxxx;</code<codeselectidfromtwherebxxx;</code我提到主键索引树和非主键索引树。第一句需要先
304.二维区域和检索 - 矩阵不可变│leetcode
<pre<code给定一个二维矩阵,计算其子矩形范围内元素的总和,该子矩阵的左上角为(row1, col1),右下角为(row2, col2)。30142563211┏2━━0━━1┓54┃101┃71┗0━━3━━0┛5
LeetCode | 面试题68 - II. 二叉树的最近公共祖先【剑指 Offer】【Python】
问题力扣(https://link.segmentfault.com/?encI2QH0szxuESleeh9cNeyYw%3D%3D.AwuguBxL7n7ZHH6DVYQ5nE5yE5XuiTA%2BRhE5i6aZFABCtyQ5lKyt2f8RWsdtnXbKhsp0Ql8
LeetCode | 面试题68 - I. 二叉搜索树的最近公共祖先【剑指 Offer】【Python】
问题力扣(https://link.segmentfault.com/?encdwoC81yJpDFjGLjg4vBxAQ%3D%3D.IZzFqlGNQsue4cvMLzcXA1p%2BaIe2L8%2FB9woJDMd3V2SqNKYTy52CdcWMNcXa5AKxck55N
LeetCode | 面试题37. 序列化二叉树【剑指 Offer】【Python】
问题力扣(https://link.segmentfault.com/?encOWU9ozmx8t%2FasN8Jb7XgdQ%3D%3D.AO9vT%2Bg0uF5jzlMghMcs5XznF3JZT4NS91Veyn9EsaOhHGt9IkVhluZSWDDb6F0Vnbq9l
每日一题896
896.单调数列(https://link.segmentfault.com/?encL2JaqMNjoe9f8uOuwPk2Xw%3D%3D.DkqsKSaWGi30q4dyTsUbiAArZiKYQy2sMDiKW4k91LrDP8IeJZ4RdCyK2azrT0q2vcAX2
每日一题 395 (滑动数组/递归)
395.至少有K个重复字符的最长子串(https://link.segmentfault.com/?encEeuFYMDHrhjSQdlnRAPQpw%3D%3D.NICA1VD%2F5%2FhBxn%2BORjyDF%2BU4YRxF8ISybllv4biaTFHR0ab6L
LeetCode | 0671. 二叉树中第二小的节点【Python】
问题力扣(https://link.segmentfault.com/?encmjGr8bJHR7nJlFQWQnj3vg%3D%3D.SPR7HtJ71aYecgcXJ2kJdZXWp8Oppym%2FlQywxxjZp0KUgnwU7yfh5g7%2BZCF9Fel9gAppt
LeetCode | 0669. 修剪二叉搜索树【Python】
问题力扣(https://link.segmentfault.com/?encO9icmk73Nc2gS2%2BhD58hFQ%3D%3D.QJAe8HxGFJwXaXc%2F5so8hyedTwVXEB7GCDrokRzu6vo3be5hvUQgSJUIjqfp2NdbduRLg
已加载文章中没有匹配内容,试试其他关键词或清空搜索。