Schwifty - 博客园

2020年8月8日

摘要： Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文

posted @ 2020-08-08 10:37 Schwifty 阅读(105) 评论(0) 推荐(0)

652. Find Duplicate Subtrees

摘要： Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any one of them. Two 阅读全文

posted @ 2020-08-08 09:17 Schwifty 阅读(192) 评论(0) 推荐(0)

2020年8月7日

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 rep 阅读全文

posted @ 2020-08-07 22:29 Schwifty 阅读(90) 评论(0) 推荐(0)

987. Vertical Order Traversal of a Binary Tree

摘要： Given a binary tree, return the vertical order traversal of its nodes values. For each node at position (X, Y), its left and right children respective 阅读全文

posted @ 2020-08-07 13:44 Schwifty 阅读(222) 评论(0) 推荐(0)

2020年8月6日

8888. Distance Between 2 Nodes in BST

摘要： Write a function that given a BST, it will return the distance (number of edges) between 2 nodes. For example, given this tree 5 / \ 3 6 / \ \ 2 4 7 / 阅读全文

posted @ 2020-08-06 13:15 Schwifty 阅读(178) 评论(0) 推荐(0)

783. Minimum Distance Between BST Nodes

摘要： Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Exa 阅读全文

posted @ 2020-08-06 13:09 Schwifty 阅读(90) 评论(0) 推荐(0)

530. Minimum Absolute Difference in BST

摘要： Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Input: 1 \ 3 / 2 O 阅读全文

posted @ 2020-08-06 12:53 Schwifty 阅读(115) 评论(0) 推荐(0)

2020年8月5日

785. Is Graph Bipartite?

摘要： Given an undirected graph, return true if and only if it is bipartite. Recall that a graph is bipartite if we can split it's set of nodes into two ind 阅读全文

posted @ 2020-08-05 13:29 Schwifty 阅读(107) 评论(0) 推荐(0)

787. Cheapest Flights Within K Stops

摘要： There are n cities connected by m flights. Each flight starts from city u and arrives at v with a price w. Now given all the cities and flights, toget 阅读全文

posted @ 2020-08-05 09:06 Schwifty 阅读(163) 评论(0) 推荐(0)

547. Friend Circles

摘要： There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct 阅读全文

posted @ 2020-08-05 02:25 Schwifty 阅读(128) 评论(0) 推荐(0)

热带雨林

公告