Heqianqian的博客

题目描述：Invert a binary tree.样例输入输出： 1 1 / \ / \2 3 => 3 2 / \ 4 4解法一： 递归实现private void invertRecursion(TreeNode root) { if (root == null) { return;

题目描述：Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value.样例输入： 1 1 / \ / \

题目描述:Flatten a binary tree to a fake “linked list” in pre-order traversal. Here we use the right pointer in TreeNode as the next pointer in ListNode.样例输入: 1 / \ 2 5 / \ \ 3 4 6样例

//从上个月末之后就开始有点浮躁起来，本来计划国庆查漏补缺v.22bd 的，结果网卡光荣的坏了ORZ……无论如何，OFFER现在还没有拿到，即便是拿到了也不该放松学习的状态。Stay Hungry，Stay Foolish背包问题是动态规划的经典问题，LeetCode上有五种背包的变种问题，现在总结一下。背包问题一（最大放入重量）题目描述：Given n items with size Ai,