摘要：
背景 在项目中，技术方案需要使用事务消息来保证最终一致性达到实现业务的目的。但在一个服务中有多个业务需要使用事务消息发送不同的消息类型到不同的Topic时，Rocket MQ的本地事务执行方法对这个Case的支持不是很好。 接下来先记录一下基础的MQ事务的使用方式，在记录一下针对上述场景中的代码实现 阅读全文
posted @ 2023-02-17 14:02
AaronTanooo
阅读(989)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-14 14:32
AaronTanooo
阅读(38)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-14 13:14
AaronTanooo
阅读(44)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-14 13:03
AaronTanooo
阅读(46)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-08 23:20
AaronTanooo
阅读(37)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-08 22:39
AaronTanooo
阅读(42)
评论(0)
推荐(0)
摘要：
105. Construct Binary Tree from Preorder and Inorder Traversal Given two integer arrays preorder and inorder where preorder is the preorder traversal 阅读全文
posted @ 2023-02-08 22:15
AaronTanooo
阅读(44)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-08 21:20
AaronTanooo
阅读(38)
评论(0)
推荐(0)
摘要：
##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 阅读全文
posted @ 2023-02-08 15:05
AaronTanooo
阅读(54)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-02-07 10:55
AaronTanooo
阅读(37)
评论(0)
推荐(0)
浙公网安备 33010602011771号