2017年06月_nudt_oys

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月

原创 LeetCode 563 Binary Tree Tilt（递归 + 中间结果保存）

Given a binary tree, return the tilt of the whole tree.The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree

2017-06-30 19:59:05 446

原创 LeetCode 538 Convert BST to Greater Tree（二叉树的右中左遍历）

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.Exampl

2017-06-29 19:19:44 522

原创 LeetCode 606 Construct String from Binary Tree

You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.The null node needs to be represented by empty parenthesis pair "()". And you

2017-06-29 09:11:29 362

原创 LeetCode 617 Merge Two Binary Trees（递归合并二叉树）

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree

2017-06-27 23:51:40 2457

原创 LeetCode 257 Bianry Tree Paths（二叉树路径保存）

Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]题目大意：给出一个二叉树，返回其所

2017-06-25 23:28:08 581

原创 CSS中的相对定位和绝对定位

相对定位在CSS中，我们可以将position属性的值设置成relative来对元素进行相对定位。如果对某元素设置了相对定位，那么该元素仍然会出现在标准文档流中它原本的位置。然后我们可以通过设置left、top等属性，让这个元素以它原来的位置为参照物进行移动。只要position属性的值为relative，无论是否对该元素进行移动，元素仍然占有原来的空间。因此，使用相对定位移动元素会使它覆盖

2017-06-14 23:58:37 430

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人