07 2019 档案

摘要:原题链接在这里:https://leetcode.com/problems/redundant-connection-ii/ 题目: In this problem, a rooted tree is a directed graph such that, there is exactly one 阅读全文
posted @ 2019-07-24 12:07 Dylan_Java_NYC 阅读(357) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/redundant-connection/ 题目: In this problem, a tree is an undirected graph that is connected and has no cycles. Th 阅读全文
posted @ 2019-07-24 11:08 Dylan_Java_NYC 阅读(250) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/satisfiability-of-equality-equations/ 题目: Given an array equations of strings that represent relationships betwe 阅读全文
posted @ 2019-07-23 11:07 Dylan_Java_NYC 阅读(337) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/regions-cut-by-slashes/ 题目: In a N x N grid composed of 1 x 1 squares, each 1 x 1 square consists of a /, \, or 阅读全文
posted @ 2019-07-23 10:42 Dylan_Java_NYC 阅读(373) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/ 题目: On a 2D plane, we place stones at some integer coordinate point 阅读全文
posted @ 2019-07-23 09:37 Dylan_Java_NYC 阅读(451) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/accounts-merge/ 题目: Given a list accounts, each element accounts[i] is a list of strings, where the first elemen 阅读全文
posted @ 2019-07-19 12:09 Dylan_Java_NYC 阅读(718) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/network-delay-time/ 题目: There are N network nodes, labelled 1 to N. Given times, a list of travel times as direc 阅读全文
posted @ 2019-07-10 10:37 Dylan_Java_NYC 阅读(360) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/ 题目: Given a binary tree rooted at root, the depth of each node is t 阅读全文
posted @ 2019-07-08 13:06 Dylan_Java_NYC 阅读(396) 评论(0) 推荐(1) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/complete-binary-tree-inserter/ 题目: A complete binary tree is a binary tree in which every level, except possibly 阅读全文
posted @ 2019-07-07 09:24 Dylan_Java_NYC 阅读(409) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/split-bst/ 题目: Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into t 阅读全文
posted @ 2019-07-07 07:48 Dylan_Java_NYC 阅读(453) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/check-completeness-of-a-binary-tree/ 题目: Given a binary tree, determine if it is a complete binary tree. Definit 阅读全文
posted @ 2019-07-07 07:22 Dylan_Java_NYC 阅读(892) 评论(1) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/ 题目: Given the root of a binary tree, find the maximum value V for 阅读全文
posted @ 2019-07-07 02:07 Dylan_Java_NYC 阅读(908) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/ 题目: We are given a binary tree (with root node root), a target node, and an 阅读全文
posted @ 2019-07-02 12:41 Dylan_Java_NYC 阅读(370) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/ 题目: Return the root node of a binary search tree that matc 阅读全文
posted @ 2019-07-02 11:10 Dylan_Java_NYC 阅读(1418) 评论(0) 推荐(0) 编辑
摘要:原题链接在这里:https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/ 题目: Given a binary tree with N nodes, each node has a different va 阅读全文
posted @ 2019-07-02 01:00 Dylan_Java_NYC 阅读(536) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示