02 2023 档案
摘要：417. Pacific Atlantic Water Flow There is an m x n rectangular island that borders both the Pacific Ocean and Atlantic Ocean. The Pacific Ocean touche
阅读全文
摘要：133. Clone Graph Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in the graph contains
阅读全文
摘要：200. Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An isl
阅读全文
摘要：基础概念 名词解释 OAth2 Spring Cloud Gateway：Spring Cloud Gateway是基于Spring Boot 2.x，Spring WebFlux和Project Reactor构建的。 Spring Security：Spring Security是一个提供身份验
阅读全文
摘要：79. Word Search Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from le
阅读全文
摘要：39. Combination Sum Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates
阅读全文
摘要：295. Find Median from Data Stream The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value
阅读全文
摘要：背景 在项目中，技术方案需要使用事务消息来保证最终一致性达到实现业务的目的。但在一个服务中有多个业务需要使用事务消息发送不同的消息类型到不同的Topic时，Rocket MQ的本地事务执行方法对这个Case的支持不是很好。 接下来先记录一下基础的MQ事务的使用方式，在记录一下针对上述场景中的代码实现
阅读全文
摘要：212. Word Search II Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from
阅读全文
摘要：211. Design Add and Search Words Data Structure Design a data structure that supports adding new words and finding if a string matches any previously
阅读全文
摘要：208. Implement Trie (Prefix Tree) A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in
阅读全文
摘要：297. Serialize and Deserialize Binary Tree Serialization is the process of converting a data structure or object into a sequence of bits so that it ca
阅读全文
摘要：124. Binary Tree Maximum Path Sum A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connect
阅读全文
摘要：105. Construct Binary Tree from Preorder and Inorder Traversal Given two integer arrays preorder and inorder where preorder is the preorder traversal
阅读全文
摘要：230. Kth Smallest Element in a BST Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the valu
阅读全文
摘要：##98. Validate Binary Search Tree Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as foll
阅读全文
摘要：102. Binary Tree Level Order Traversal Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to rig
阅读全文
摘要：235. Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in
阅读全文
摘要：572. Subtree of Another Tree Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure a
阅读全文
摘要：100. Same Tree Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the
阅读全文
摘要：217. Contains Duplicate Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the long
阅读全文
摘要：226. Invert Binary Tree Given the root of a binary tree, invert the tree, and return its root. Constraints: The number of nodes in the tree is in the
阅读全文
摘要：23. Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists int
阅读全文
