Programmer Think

summary In actual development, it is often necessary to store a set (more than one) of data for later code to use. At this point, you may have heard of an Array, which can store multiple data one by one, and each element in the Array can be accessed through the Array subscript. It should be clear that Python does not have arrays, but adds ...

Joseph problem (array + queue + formula iteration + recursion) The Joseph Ring problem originates from a Jewish story: The Romans captured the bridge Tapat, and 41 people hid in a cave to escape the catastrophe. Among the 41 people, the historian Josephus (Joseph) and one of his friends. The remaining 39 people decided to commit collective sui ...

About Vue3 and MIT The usage of JS is introduced in another article Some Vue3 knowledge points sorted out (550)+ 👍) Demand introduction Recently, the company has a demand for a mobile page. A page contains multiple floors, each of which is a separate component. Each component has its own logic. The page is similar to the welfare page of ...

Definition: dead letter refers to messages that cannot be consumed. Dead letter queue is the queue for storing dead letters Source: Message TTL expired, maximum queue length reached, message rejected actual combat One producer and two consumers (C1 and C2), and the producer passes normal of direct type_ Exchange (the bindingKey is zh ...

queue Queue is another special linear table. Its particularity is that queue only allows inserting data elements at the end of the table and deleting data elements at the header. It has the characteristics of first in, first out, then in and then out.We call the end that is allowed to be deleted as the front and the end that is inserted as the ...

1. Queue 1.1 concept Queue: a special linear table that only allows inserting data at one end and deleting data at the other end. The queue has the characteristics of first in first out FIFO(First In First Out). Queue entry: the end of the insertion operation is called Tail/Rear Out of queue: the end for deletion is called Head/Front Ill ...

Title one sword refers to Offer 32 - I. print binary tree from top to bottom Source: LeetCode Link: https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/ 1. Description Each node of the binary tree is printed from top to bottom, and the nodes of the same layer are printed from left to right. 2. Examples Example 1: Given ...

RabbitMQ (VII) - release confirmation Release confirmation principle The producer sets the channel to confirm mode. Once the channel enters the confirm mode, all messages published on the channel will be assigned a unique ID (starting from 1). Once the message is delivered to all matching queues, the broker will send a confirmation to the pro ...

Article catalog Message queue RocketMQ: (I) overview Message queuing RocketMQ: (II) system architecture Message queue RocketMQ: (III) sending ordinary messages (three methods) Message queue RocketMQ: (IV) sequential messages Message queue RocketMQ: (V) delay message Message queue RocketMQ: (VII) batch messages premise Create a Maven J ...

catalogue Parity tree describe Example 1 Example 2 Example 3 Example 4 Example 5 Tips data structure Methods: breadth first search Parity tree describe If a binary tree satisfies the following conditions, it can be called a parity tree: The subscript of the layer where the root node of the binary tree is located is 0, the subsc ...