随笔分类 -  LeetCode

上一页 1 2 3 4 5 6 7 ··· 9 下一页
LeetCode | 0538. 把二叉搜索树转换为累加树【Python】
摘要：Problem LeetCode Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the 阅读全文
posted @ 2021-01-07 21:08 Wonz 阅读(87) 评论(0) 推荐(0)
LeetCode | 0230. 二叉搜索树中第K小的元素【Python】
摘要：Problem LeetCode Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Example 1: Input: root = [3,1,4,null 阅读全文
posted @ 2021-01-07 20:54 Wonz 阅读(100) 评论(0) 推荐(0)
LeetCode | 0654. Maximum Binary Tree最大二叉树【Python】
摘要：Problem LeetCode Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number 阅读全文
posted @ 2021-01-06 22:46 Wonz 阅读(188) 评论(0) 推荐(0)
LeetCode | 0114. 二叉树展开为链表【Python】【Go】
摘要：Problem LeetCode Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 The flattened 阅读全文
posted @ 2021-01-06 21:39 Wonz 阅读(137) 评论(0) 推荐(0)
LeetCode 0116. 填充每个节点的下一个右侧节点指针【Python】【Go】
摘要：Problem LeetCode You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has th 阅读全文
posted @ 2021-01-06 21:05 Wonz 阅读(85) 评论(0) 推荐(0)
LeetCode 0090. Subsets II子集II【Python】
摘要：Problem LeetCode Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution s 阅读全文
posted @ 2020-11-27 22:12 Wonz 阅读(95) 评论(0) 推荐(0)
合集 | LeetCode 个人题解目录（长期更新）
摘要：目录 No. Problem LeetCode 力扣 Python Go Solution Difficulty Tag 0017 Letter Combinations of a Phone Number LeetCode 力扣 Python CSDN Medium 回溯、暴力 0034 Find 阅读全文
posted @ 2020-11-25 22:52 Wonz 阅读(175) 评论(0) 推荐(0)
LeetCode 0078. Subsets子集【Python】
摘要：LeetCode 0078. Subsets子集【Medium】【Python】【回溯】 Problem LeetCode Given a set of distinct integers, nums, return all possible subsets (the power set). Not 阅读全文
posted @ 2020-10-24 18:05 Wonz 阅读(214) 评论(0) 推荐(0)
LeetCode | 0051. N-Queens N 皇后【Python】
摘要：Problem LeetCode The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integ 阅读全文
posted @ 2020-09-10 22:59 Wonz 阅读(200) 评论(0) 推荐(0)
LeetCode | 0040. Combination Sum II组合总和 II【Python】
摘要：Problem LeetCode Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where t 阅读全文
posted @ 2020-09-10 10:29 Wonz 阅读(167) 评论(0) 推荐(0)
LeetCode | 0491. Increasing Subsequences递增子序列【Python】
摘要：LeetCode 0491. Increasing Subsequences递增子序列【Medium】【Python】【DFS】 Problem LeetCode Given an integer array, your task is to find all the different possi 阅读全文
posted @ 2020-08-25 19:42 Wonz 阅读(157) 评论(0) 推荐(0)
LeetCode | 0529. Minesweeper扫雷游戏【Medium】【Python】【DFS】
摘要：LeetCode 0529. Minesweeper扫雷游戏【Medium】【Python】【DFS】 Problem LeetCode Let's play the minesweeper game (Wikipedia, online game)! You are given a 2D char 阅读全文
posted @ 2020-08-21 17:15 Wonz 阅读(158) 评论(0) 推荐(0)
LeetCode | 0647. Palindromic Substrings回文子串【Medium】【Python】【中心扩展】【动态规划】
摘要：LeetCode 0647. Palindromic Substrings回文子串【Medium】【Python】【中心扩展】【动态规划】 Problem LeetCode Given a string, your task is to count how many palindromic subs 阅读全文
posted @ 2020-08-21 16:41 Wonz 阅读(164) 评论(0) 推荐(0)
LeetCode | 0111. Minimum Depth of Binary Tree二叉树的最小深度【Easy】【Python】【二叉树】
摘要：LeetCode 0111. Minimum Depth of Binary Tree二叉树的最小深度【Easy】【Python】【二叉树】 Problem LeetCode Given a binary tree, find its minimum depth. The minimum depth 阅读全文
posted @ 2020-08-21 15:54 Wonz 阅读(136) 评论(0) 推荐(0)
LeetCode | 0098. Validate Binary Search Tree验证二叉搜索树【Python】
摘要：LeetCode 0098. Validate Binary Search Tree验证二叉搜索树【Medium】【Python】【二叉树】 Problem LeetCode Given a binary tree, determine if it is a valid binary search 阅读全文
posted @ 2020-06-28 20:22 Wonz 阅读(134) 评论(0) 推荐(0)
LeetCode | 0700. Search in a Binary Search Tree二叉搜索树中的搜索【Python】
摘要：LeetCode 0700. Search in a Binary Search Tree二叉搜索树中的搜索【Easy】【Python】【二叉树】 Problem LeetCode Given the root node of a binary search tree (BST) and a val 阅读全文
posted @ 2020-06-28 20:02 Wonz 阅读(162) 评论(0) 推荐(0)
LeetCode | 0701. Insert into a Binary Search Tree 二叉搜索树中的插入操作【Python】
摘要：LeetCode 0701. Insert into a Binary Search Tree 二叉搜索树中的插入操作【Medium】【Python】【二叉树】 Problem LeetCode Given the root node of a binary search tree (BST) an 阅读全文
posted @ 2020-06-28 19:45 Wonz 阅读(143) 评论(0) 推荐(0)
LeetCode | 0450. Delete Node in a BST 删除二叉搜索树中的节点【Python】
摘要：LeetCode 0450. Delete Node in a BST 删除二叉搜索树中的节点【Medium】【Python】【二叉树】 Problem LeetCode Given a root node reference of a BST and a key, delete the node 阅读全文
posted @ 2020-06-28 19:04 Wonz 阅读(235) 评论(0) 推荐(0)
LeetCode | 0100. Same Tree 相同的树【Python】
摘要：LeetCode 0100. Same Tree 相同的树【Easy】【Python】【二叉树】 Problem LeetCode Given two binary trees, write a function to check if they are the same or not. Two b 阅读全文
posted @ 2020-06-28 09:47 Wonz 阅读(176) 评论(0) 推荐(0)
LeetCode | 1410. HTML Entity Parser HTML 实体解析器【Python】
摘要：LeetCode 1410. HTML Entity Parser HTML 实体解析器【Medium】【Python】【字符串】 Problem "LeetCode" HTML entity parser is the parser that takes HTML code as input an 阅读全文
posted @ 2020-04-12 22:22 Wonz 阅读(286) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 ··· 9 下一页