Programming VIP

Dictionary tree Concept of dictionary tree This section is mainly for reference Reference link Dictionary tree is also called Trie tree and prefix tree. As the name suggests, it is a data structure that maintains strings. Dictionary tree, as the name suggests, is a tree about "dictionary". That is, it is a storage method for ...

leetcode - 129. Find the sum of numbers from root node to leaf node Give you the root node of a binary tree, root. Each node in the tree stores a number between 0 and 9. Each path from the root node to the leaf node represents a number: For example, the path 1 - > 2 - > 3 from the root node to the leaf node represents the number 123 ...

2022-01-02 swipe questions and punch in every day Flying book - daily question 42. Rainwater connection Given n non negative integers to represent the height diagram of each column with width 1, calculate how much rain the columns arranged according to this can receive after rain. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Outp ...

1, Title Requirements Give you a matrix with m rows and n columns. Please return all the elements in the matrix in a clockwise spiral order.Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output:[1,2,3,6,9,8,7,4,5] Example 2: Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]] Output:[1,2,3,4,8,12,11,10,9,5,6,7] Tips: m == mat ...

📢 preface 🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌲 Punching out an algorithm problem every day is not only a learning process, but also a sharing process 😜🌲 Tip: the problem-solving programming languages in this column are C# and Java🌲 To maintain a state of learning every day, let's wo ...

Simple knowledge of bit operation Several points to remember in bit operation are: If you want to go to the last place, use num% 2To remove the last bit, use num = num / 2If it is judged that a number is the power of 2, use (n & - n) = = n, which will be described in detail belowThe XOR of two identical numbers is 0, the XOR value of al ...

First BB I haven't done algorithm problems for some time. I haven't participated in the LeetCode weekly competition since preparing for the spring move. I was able to do two or three problems correctly two or three years ago. These years have passed, this level has even regressed a lot. It seems that you can still remember that when you fi ...

Title Description Give you a linked list, delete the penultimate node of the linked list, and return the head node of the linked list. Advanced: can you try using one scan? Example: Input: head = [1,2,3,4,5], n = 2 Output:[1,2,3,5] Input: head = [1], n = 1 Output:[] Input: head = [1,2], n = 1 Output:[1] preface When operating th ...

1, Introduction The mainstream communication protocols for microservices include RPC,Http, and SpringCloud, which are based on the Http Restful style. There are many ways to initiate an Http request in Java, such as Apache's HttpClient, OKHttp, and so on. Spring encapsulates a Restful based and very simple Http client tool RestTemplate. We use ...

Catalogue of series articles Force deduction hot question brushing record preface Make a little progress every day!! 1, Background For a group of people, there are two information about them. The first is the height information, and the second is how many people are taller (> =) than them in front of them. According to these informa ...