beautymo - 简书

IP属地：天津

[Leetcode]64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from to...

127 0 0
[Leetcode]226. Invert Binary Tree
解释：就是把一棵二叉树的左子树和右子树不停交换，还是挺简单的，代码如下：易错：此时那棵交换后的树是这样的：出现的问题是1,3的双亲本来是2...

231 0 0

[Leetcode]107. Binary Tree Level Order Traversal II
用队列实现树的广度优先搜索题目如下：实现代码如下：以前一直写的深度优先，感觉这个还是蛮新鲜的，作为c++萌新，也学了一些c++中queue...

276 0 0
[Leetcode]112. Path Sum
问题描述：Given a binary tree and a sum, determine if the tree has a root-to-...

217 0 0
[Leetcode]110. Balanced Binary Tree
题目：Given a binary tree, determine if it is height-balanced. For this pro...

172 0 0
[Leetcode]111. Minimum Depth of Binary Tree
题目描述：Given a binary tree, find its minimum depth. The minimum depth is t...

145 0 0
顺序表简单实现
考研数据结构得用c或c++写，写java的我终于还是被拉回来开始艰难而又咸鱼的c++学习,写的可能不是很好，凑合看看吧注：若函数形参中用的是...

299 0 0