_Zlrrr - 博客园

2018年12月19日

#Leetcode# 951. Flip Equivalent Binary Trees

摘要： https://leetcode.com/problems/flip-equivalent-binary-trees/ For a binary tree T, we can define a flip operation as follows: choose any node, and swap 阅读全文

posted @ 2018-12-19 17:29 _Zlrrr 阅读(188) 评论(0) 推荐(0)

#Leetcode# 145. Binary Tree Postorder Traversal

摘要： https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return the postorder traversal of its nodes' values. Example: Foll 阅读全文

posted @ 2018-12-19 17:02 _Zlrrr 阅读(114) 评论(0) 推荐(0)

2018年12月18日

#Leetcode# 103. Binary Tree Zigzag Level Order Traversal

摘要： https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Given a binary tree, return the zigzag level order traversal of its nodes' val 阅读全文

posted @ 2018-12-18 21:54 _Zlrrr 阅读(138) 评论(0) 推荐(0)

#Leetcode# 222. Count Complete Tree Nodes

摘要： https://leetcode.com/problems/count-complete-tree-nodes/ Given a complete binary tree, count the number of nodes. Note: Definition of a complete binar 阅读全文

posted @ 2018-12-18 19:09 _Zlrrr 阅读(145) 评论(0) 推荐(0)

#Leetcode# 107. Binary Tree Level Order Traversal II

摘要： https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ Given a binary tree, return the bottom-up level order traversal of its nodes' valu 阅读全文

posted @ 2018-12-18 18:50 _Zlrrr 阅读(140) 评论(0) 推荐(0)

PAT 甲级 1101 Quick Sort

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805366343188480 There is a classical process named partition in the famous quick sort al 阅读全文

posted @ 2018-12-18 14:31 _Zlrrr 阅读(362) 评论(0) 推荐(0)

PAT 甲级 1038 Recover the Smallest Number

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805449625288704 Given a collection of number segments, you are supposed to recover the s 阅读全文

posted @ 2018-12-18 14:11 _Zlrrr 阅读(225) 评论(0) 推荐(0)

#Leetcode# 112. Path Sum

摘要： https://leetcode.com/problems/path-sum/ Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the value 阅读全文

posted @ 2018-12-18 13:54 _Zlrrr 阅读(109) 评论(0) 推荐(0)

2018年12月17日

#Leetcode# 17. Letter Combinations of a Phone Number

摘要： https://leetcode.com/problems/letter-combinations-of-a-phone-number/ Given a string containing digits from 2-9 inclusive, return all possible letter c 阅读全文

posted @ 2018-12-17 22:04 _Zlrrr 阅读(122) 评论(0) 推荐(0)

#Leetcode# 235. Lowest Common Ancestor of a Binary Search Tree

摘要： https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ Given a binary search tree (BST), find the lowest common ancestor (LCA) 阅读全文

posted @ 2018-12-17 19:05 _Zlrrr 阅读(127) 评论(0) 推荐(0)

丧心病狂工科女

公告