文章
leetcode443. String Compression
题目要求<pre<codeGivenanarrayofcharacters,compressitinplace.Thelengthaftercompressionmustalwaysbesmallerthanorequaltotheor
计算器
最近准备系统的学习数据结构与算法,学习的时候想配合着leetcode刷题,这样会加深印象。在学习栈的时候,老师举了计算器实现的例子,我搜了一下leetcode刚好有这样的题,就想着自己实现一下吧。leetcode题目:leetcode224(https://link.segme
[Leetcode]2.Add Two Numbers
<blockquoteYouaregiventwononemptylinkedlistsrepresentingtwononnegative<br/integers.Thedigitsarestoredinreverseorderandeachofth
[LeetCode]1. Two Sum
<blockquoteGivenanarrayofintegers,returnindicesofthetwonumberssuch<br/thattheyadduptoaspecifictarget.<pYoumayassumethateachi
【Leetcode】114. 二叉树展开为链表
题目给定一个二叉树,原地将它展开为链表。例如,给定二叉树<pre<code1/\25/\\346</code</pre将其展开为:<pre<code1\2\3\
Leetcode PHP题解--D33 700. Search in a Binary Search Tree
700.SearchinaBinarySearchTree题目链接700.SearchinaBinarySearchTree(https://link.segmentfault.com/?encULK7S%2FxYAUKaZ%2F%2BqTV
5030-节点与其祖先之间的最大差值
前言WeeklyContest132(https://link.segmentfault.com/?encgT8iHoKmng4rq0TAFffXQQ%3D%3D.6qc0oh6Yw%2FP776zNGrTqyxwvaw%2Fv9NnhDFnb6j6acwc0be1Bxgsry
5024-除数博弈
前言WeeklyContest132(https://link.segmentfault.com/?encaD22Y5TmvFzGqE7Jkjg%2BUw%3D%3D.GVa%2BVDoIJw1V3Ng2AE5VnDiLRXW7S04A6Ugv9ae2zXQX9BUVAcj%2
【Leetcode】113. 路径总和II
题目给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。说明:叶子节点是指没有子节点的节点。示例:给定如下二叉树,以及目标和sum22,<pre<code5/\
Leetcode PHP题解--D32 617. Merge Two Binary Trees
617.MergeTwoBinaryTrees题目链接617.MergeTwoBinaryTrees(https://link.segmentfault.com/?encnibDqhNLSPeHhIJQqfBUtQ%3D%3D.JsQCwlEOTK9
已加载文章中没有匹配内容,试试其他关键词或清空搜索。