## Data structure sequence table (c language)

Storage structure of sequence table
(1) When a high-level programming language such as c language is used to describe the problem of data structure, the method to realize the sequential storage structure is to use array. (2) There are two kinds of arrays: static array and dynamic array. The application and release of static array storage space ...

Added by **herreram** on *Sat, 05 Mar 2022 02:04:46 +0200*

## C++---stack & queue & adapter mode & priority queue & imitation function

catalogue
1, Container adapter
1. What is an adapter?
2, Introduction and use of stack and queue
1. Introduction to stack
2. Use of stack
3. Introduction to queue
4. Use of queue
3, deque's brief introduction (understanding)
1. Principle of deque
2. Defects of deque
4, Simulation of stack and queue
1. Simulation Implementation of st ...

Added by **jasonhardwick** on *Fri, 04 Mar 2022 22:03:33 +0200*

## Java data structure and algorithm -- in situ hash algorithm

In situ hash algorithm
The in-situ hash algorithm is used to solve the problem with spatial complexity of O(1), and the result range is between [0, len (Num)], and num is the solution array provided by the problem.
The in-situ hash algorithm is mainly used in the array solution with the result range of [0, len (Num)]. The space complexity is ...

Added by **wisewood** on *Fri, 04 Mar 2022 20:30:33 +0200*

## Java heap & priority queue

catalogue
1. Priority queue
1.1 concept
1.2 internal principle
1.3 operation - queue entry
3.4 operation - out of queue (highest priority)
3.5 borrow heap to realize priority queue
1. Implement an interface
2. See the previous section for the complete code of the heap
3. Priority queue
3.6 testing
1. Priority queue
1.1 concept
...

Added by **fris** on *Fri, 04 Mar 2022 19:51:43 +0200*

## Three hundred rows per day (13 days: linked list)

Three hundred rows per day (13 days: linked list)
Note: here are the synchronous notes and records of JAVA self-study and understanding. If you have any questions, please correct them
1, About linked list
The logical structure and physical structure of the linked list are not as close as the sequential list. The physical storage of the ...

Added by **davidlenehan** on *Fri, 04 Mar 2022 16:56:57 +0200*

## Leetcode one question per day (two questions) - 3.4 + 3.3

Leetcode one question per day (two questions) - 3.4 + 3.3
preface
I wrote the daily question of these two days, learned some new knowledge points, and made a comb and summary.
3.3 add up
Given a non negative integer num, the numbers on each bit are added repeatedly until the result is a single digit. Return this result.
Title Link ...

Added by **rsnell** on *Fri, 04 Mar 2022 16:16:11 +0200*

## Leetcode2104: subarray range and (medium, iteration)

1. Title Description
Give you an integer array nums. In nums, the range of subarray is the difference between the largest element and the smallest element in the subarray. Returns the sum of all subarray ranges in num. A subarray is a sequence of consecutive non empty elements in an array.
Example 1: Input: num = [1,2,3] Output: 4 Explanatio ...

Added by **gilliat** on *Fri, 04 Mar 2022 11:36:13 +0200*

## STL set container multiset container

Containers in STL:
set container common interfaces and usage of multiset container:
set / multiset container: also known as a set, all elements are automatically sorted when inserted (from small to large, i.e. ascending)
Bottom structure of set / multiset container: these two containers belong to associative containers, and the bottom stru ...

Added by **anindya23** on *Fri, 04 Mar 2022 11:02:06 +0200*

## Implementation of hash table

1. Hash table Note 1 Note 2 Hash table (also known as hash table) is a data structure that is accessed directly according to the key value. That is, it accesses records by mapping key values to a location in the table to speed up the search. This mapping function is called hash function, and the array storing records is called hash table. Hash ...

Added by **dcole** on *Fri, 04 Mar 2022 08:31:02 +0200*

## Recursion and divide and conquer thought 3

Link: Login - professional IT written examination interview preparation platform_ Niuke network Source: niuke.com
Middle order sequence
Given the preorder traversal and postorder traversal sequences of a binary tree with n nodes, find the middle order traversal sequence. If a node has only one child node, it will be regarded as the left c ...

Added by **d_mc_a** on *Fri, 04 Mar 2022 07:58:10 +0200*