Programmer Think

Word splitting (medium) dynamic programming ”Whether leetcode "can be composed and decomposed into - whether" l "is stored in the dictionary and subsequent substrings can be composed when the step size is 1, etc; When the step size is 2, "le" is stored in the dictionary and subsequent substrings can be compose ...

Java collection framework (III) Map interface Characteristics of Map implementation class Map: double column data, which stores the data of key value pairs, similar to the function of high school, y=f (x) Implementation class: HashMap: as the main implementation class of Map; Unsafe thread and high efficiency; null key s and value s ca ...

Record of sword finger offer (1) (February 18, 2022) Write in the front: I haven't learned c + +. Refer to the problem-solving comments and learn while brushing the questions. data structure Print linked list from end to end describe Enter the head node of a linked list and return the value of each node in the order from the end to the h ...

List 1. Introduction 1.1. Abstract Data Types(ADTS) ADT definition: a set of objects together with a set of operations Abstract data types are mathematical abstractions; nowhere in an ADT‟s definition is there any mention of how the set of operations is implemented. A set of objects and a set of operations. Abstract data types are mathemat ...

What is a hash table? Hash tables, also known as hash tables, are array based. This indirectly brings an advantage: the time complexity of search is O(1), and of course, its insertion time complexity is also O(1). There is also a disadvantage: the expansion cost is high after the array is created. There is a "mainstream" idea in hash ...

Catalogue of series articles I Array type problem solving method 1: dichotomy II Array type problem solving method 2: Double finger needle method III Array type problem solving method 3: sliding window IV Array type problem solving method 4: simulation V The basic operation and classic topics of the linked list Vi Classic title of hash tab ...

1 topic analysis Link: 138. Copy the linked list with random pointer - LeetCode (LeetCode CN. Com) Give you a linked list with a length of n. each node contains an additional random pointer random, which can point to any node or empty node in the linked list. Construct a deep copy of this linked list. The deep copy should consist of exac ...

1. Sequence traversal Sequence traverses a binary tree. It is to traverse the binary tree layer by layer from left to right. In order to realize sequence traversal, we need to use an auxiliary data structure, namely queue. Queue first in first out conforms to the logic of layer by layer traversal, while stack first in last out is suitab ...

1, Linear table Linear table: when data is stored, it is stored continuously according to logic and forms a linear structure (feature: all have the concept of index, and the elements with smaller index must be logically arranged before the elements with larger index) Linear list subset: sequential list, linked list, stack, queue, string ...

All the code in this article is written in C + + 4 double linked list, circular linked list and static linked list 4.1 double linked list 4.1.1 definition of double linked list In the previous knowledge, we once said that because each data element in the single linked list is divided into two parts - data field and pointer field, the ...