Programmer Think

1,addNode(val): Add elements at the end of the linked list( val Is the value of the node. 2,Length(): The length of the linked list. 3,display(): Print the linked list. 4,ModifyValue(val1,val2): Replaces the specified value. 5,findValue(val): Finds the specified value,Return to its location. 6,DeleteValue(val): Deletes the specified no ...

Principle and implementation of dynamic expansion array What is a data structure? Data structure is a way for computer to store and organize data; Linear table A linear table is a finite sequence with n elements of the same type (n ≥ 0) a1 is the first node (first element) and an is the tail node (tail element)a1 is the precursor of ...

1, Foreword  details of Java performance optimization affecting performance - continued. I intend to write the whole series of articles with this title slowly. This is the first article entrance . This time, the content mainly comes from the book "actual combat of Java program performance optimization". It is a reading note. Int ...

Introduction of generics Generics in the last article Collection framework is the underlying data structure It has been lowered and is ready for use. There are two concepts to understand before you start First, we know a premise in learning polymorphism that references to base classes can point to objects in subclasses.Second, we als ...

JavaScript implementation of sorting algorithm 1, Large O representation Large O notation: In the computer, a rough measure is used to describe the efficiency of computer algorithms. This method is called * * "Big O" representation**When the number of data items changes, the efficiency of the algorithm will also change. Therefore, ...

DP + complete knapsack problem: PIPI's piggy bank Complete knapsack problem   we talked about the 01 knapsack problem earlier: DP + 01 backpack question: meal card . Now let's look at the complete knapsack problem. The only difference between the complete knapsack problem and the 01 knapsack problem is that each item in the 01 knaps ...

Write in front From a certain point of view, the LIFO (last in first out) feature of the stack is a very useful feature, which makes the stack particularly important. The so-called LIFO is the last in first out, and the last in elements go out first, just as in the figure below. In Java, the Java class library has provided us with a Stack c ...

Dijkstra Algorithm idea: Core: the shortest path is generated in the order of increasing path length Algorithm process: Divide V into two groups: one    S: The set of vertices for which the shortest path has been found two   V-S = T: the set of vertices for which the shortest path has not been determined Add the vertices i ...

1, Linear table 1. Linearity table The linear structure of an ordered sequence composed of data elements of the same type. The starting position of a table is called the header, and the ending position of a table is called the footer. Except that the first element has no direct precursor and the last element has no direct successor, ever ...

1, General introduction to linked list: 1. single linked list: Each linked list has a next pointer to the next node and a member to store values 2. Double linked list: Based on the single linked list, there is also a prev pointer to the previous node.   3. Summary: (1) Linked lists are stored as nodes (2) Each node contains the da ...