是念的博客_python(7)

[leetcode] 1339. Maximum Product of Splitted Binary Tree

DescriptionGiven a binary tree root. Split the binary tree into two subtrees by removing 1 edge such that the prod

二叉树

参考文献

子树

原创 2022-08-11 17:38:36 45 阅读

[leetcode] 1372. Longest ZigZag Path in a Binary Tree

DescriptionGiven a binary tree root, a ZigZag path for a binary tree is defined as follow:Choose any node in the binary tree and a directio

参考文献

c++

动态规划

原创 2022-08-11 17:38:30 19 阅读

[leetcode] 1325. Delete Leaves With a Given Value

DescriptionGiven a binary tree root and an integer target, delete all the leaf nodes with value target.Note that

结点

删除结点

递归

原创 2022-08-11 17:38:23 29 阅读

[leetcode] 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree

DescriptionGiven two binary trees original and cloned and given a reference to a node target in the original tree.Th

二叉树

结点

原创 2022-08-11 17:38:19 54 阅读

[leetcode] 1448. Count Good Nodes in Binary Tree

DescriptionGiven a binary tree root, a node X in the tree is named good if in the path from root to X there a

结点

参考文献

java

原创 2022-08-11 17:38:14 14 阅读

[leetcode] 872. Leaf-Similar Trees

DescriptionConsider all the leaves of a binary tree, from left to right order, the values of those leaves form a l

结点

ide

二叉树

原创 2022-08-11 17:37:48 36 阅读

[leetcode] 1324. Print Words Vertically

DescriptionGiven a string s. Return all the words vertically in the same order in which they appear in s.Words are returned as a list of strings, complete with spaces when is necessa

字符串

原创 2022-08-11 17:37:41 37 阅读

[leetcode] 894. All Possible Full Binary Trees

DescriptionA full binary tree is a binary tree where each node has exactly 0 or 2 children.Return a list of all possible full

二叉树

结点

递归

原创 2022-08-11 17:37:35 46 阅读

[leetcode] 897. Increasing Order Search Tree

DescriptionGiven a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is no

结点

二叉排序树

子树

原创 2022-08-11 17:37:23 38 阅读

[leetcode] 919. Complete Binary Tree Inserter

DescriptionA complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and

结点

参考文献

完全二叉树

原创 2022-08-11 17:37:17 20 阅读

[leetcode] 951. Flip Equivalent Binary Trees

DescriptionFor a binary tree T, we can define a flip operation as follows: choose any node, and swap t

二叉树

递归

原创 2022-08-11 17:37:10 10 阅读

[leetcode] 958. Check Completeness of a Binary Tree

DescriptionGiven a binary tree, determine if it is a complete binary tree.Definition of a complete binary tree fr

完全二叉树

数组

子节点

原创 2022-08-11 17:37:05 44 阅读

[leetcode] 938. Range Sum of BST

DescriptionGiven the root node of a binary search tree, return the sum of values of all nodes with value between L

结点

递归遍历

递归

原创 2022-08-11 17:37:00 45 阅读

[leetcode] 965. Univalued Binary Tree

DescriptionA binary tree is univalued if every node in the tree has the same value.Return true if and only if the given tree is

1024程序员节

递归

结点

二叉树

原创 2022-08-11 17:36:53 25 阅读

[leetcode] 971. Flip Binary Tree To Match Preorder Traversal

DescriptionGiven a binary tree with N nodes, each node has a different value from {1, …, N}.A node in this binary tree can be flipped by swap

1024程序员节

参考文献

ide

python

原创 2022-08-11 17:36:48 32 阅读

[leetcode] 979. Distribute Coins in Binary Tree

DescriptionGiven the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.In one move, we may choo

1024程序员节

递归

参考文献

二叉树

Python

原创 2022-08-11 17:36:41 29 阅读

[leetcode] 987. Vertical Order Traversal of a Binary Tree

DescriptionGiven a binary tree, return the vertical order traversal of its nodes values.For each node at positi

1024程序员节

python

参考文献

递归遍历

原创 2022-08-11 17:36:35 48 阅读

ubuntu 16.04 安装mujoco-py==2.1.2.14

今天在ubuntu中安装了mujoco-py，安装过程还是挺曲折的，我这里记录一下我的安装

ubuntu

linux

git

github

安装过程

原创 2022-08-11 17:36:25 350 阅读

[leetcode] 998. Maximum Binary Tree II

DescriptionWe are given the root node of a maximum tree: a tree where every node has a value greater tha

1024程序员节

结点

递归

参考文献

原创 2022-08-11 17:36:16 46 阅读

[leetcode] 1026. Maximum Difference Between Node and Ancestor

DescriptionGiven the root of a binary tree, find the maximum value V for which there exists different nodes A and

最小值

参考文献

结点

原创 2022-08-11 17:36:10 48 阅读

[leetcode] 1008. Construct Binary Search Tree from Preorder Traversal

DescriptionReturn the root node of a binary search tree that matches the given preorder traversal.(Recall that a binary search tree is a b

结点

二叉搜索树

数组

原创 2022-08-11 17:36:04 32 阅读

[leetcode] 1161. Maximum Level Sum of a Binary Tree

DescriptionGiven the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.Retur

结点

层序遍历

二叉树

原创 2022-08-11 17:35:58 30 阅读

在二叉树中找到累加和为指定值的最长路径长度

Description给定一颗二叉树和一个整数 sum，求累加和为 sum 的最长路径长度。路

算法

二叉树

最长路

父节点

原创 2022-08-11 17:35:43 96 阅读

python 画带有标签分布的直方图

最近在写代码的时候需要可视化一些特征，想了解一下某些离散特征的label分布，其eep"

数据

参考文献

github

原创 2022-08-11 17:35:38 545 阅读

[leetcode] 935. Knight Dialer

DescriptionThe chess knight has a unique movement, it may move two

初始化

递推公式

参考文献

原创 2022-08-11 17:35:34 115 阅读

[leetcode] 1556. Thousand Separator

DescriptionGiven an integer n, add a dot (".") as the thousands separator and return it in string form

字符串

python

参考文献

原创 2022-08-11 17:35:28 33 阅读

pytorch transformers从头开始实现情感分析模型

最近用transformers用的比较多，用transformers加载预训练模型，然后做预测的教程

数据

加载

情感分析

原创 2022-08-11 17:35:24 194 阅读

[leetcode] 1544. Make The String Great

DescriptionGiven a string s of lower and upper case English letters.A good string is a string which doesn’t have

字符串

参考文献

ios

原创 2022-08-11 17:35:21 20 阅读

[leetcode] 1105. Filling Bookcase Shelves

DescriptionWe have a sequence of books: the i-th book has thickness books

数组

参考文献

子数组

原创 2022-08-11 17:35:15 151 阅读

[leetcode] 1529. Bulb Switcher IV

DescriptionThere is a room with n bulbs, numbered from 0 to n-1, arranged in a row from left to rig

字符串

参考文献

字符串转换

原创 2022-08-11 17:35:14 90 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客