Programmer Think

1, LeetCode 21. Merge two ordered linked lists Method 1: iteration Code and performance class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode dummy = new ListNode(-1); ListNode p = dummy; ListNode p1 = l1; ListNode p2 = l2; while(p1 != null && p2 != null){ ...

Write in front We talked about the basic concept of tree. This article mainly talks about the basic operations of common trees, such as finding, adding, deleting, etc. It is easier to understand by moving graph. Binary lookup tree Binary Sort Tree (BST), also known as Binary Sort Tree, or binary search tree. A binary lookup tree satisfies the f ...

overview RequestBodyAdvice RequestBodyAdvice is an interface provided by spring mvc4.2, which allows the request body to be read and converted into an object, and takes the processing result object as the @ RequestBody parameter or the @ HttpEntity method parameter. It can be seen that its scope of action is: Parameters marked with @ RequestB ...

Huffman tree definition: Given N weights as N leaf nodes, a binary tree is constructed. If the weighted path length of the tree reaches the minimum, such a binary tree is called the optimal binary tree, also known as Huffman tree. Huffman tree is the tree with the shortest weighted path length, and the node with larger weight is closer to th ...

When an array simulates a queue, there will be a problem that it cannot be reused. Here, a ring queue is used to solve the problem. Because the simulation is a ring queue, let's adjust the meaning of each attribute in the queue. 1. Analysis:   The original acyclic queue (non ring queue) cannot store data when the tail pointer of rear reac ...

Stack Definition of stack Stack is a linear table with limited operation. It can only enter or output elements from one end. It has the property of * * last in first out (LIFO) * *. The first data is pushed into the bottom of the stack, and the last data is at the top of the stack. When you need to read data, POP up data from the top of the s ...

C/S program of TCP protocol Two classes need to be used to write CS programs of TCP protocol: ServerSocker build serverSocker build client During network construction, there must be a server first, and then we can build a client connection server. Two classes are described below: ServerSocker It is used to create a server. After creat ...

Chapter 8 search algorithm 1. Introduction to search algorithm Sequential (linear) lookup Binary search / half search Interpolation lookup fibonacci search 2. Linear search Write linear search algorithm code public class SeqSearch { public static void main(String[] args) { int[] arr = { 1, 2, 3, 4, 5 };// Array without order int inde ...

Basic introduction: 1) to set n Weights as n individual leaf node , construct a binary tree if the Weighted path length degree ( wpl ) reach To the minimum, such a binary tree is called Optimal binary tree , also known as Huffman tree (Huffman Tree ) 2) Hector husband Man tree It is the tree with the shorte ...

7, Figure Basic concept of graph 1. Graph: graph G is composed of two sets V and E, marked as G=(V,E), where V is a finite nonempty set of vertices and E is a finite set composed of ordered pairs of vertices in V. these ordered pairs are called edges or arcs 2. Undirected graph 3. Directed graph 4. Complete graph: if there are edges ...