The data structure
1. How many kinds of data structure storage are commonly used? What are their characteristics?
There are two kinds of sequential storage structure and chain storage structure commonly used in data structure storage
- Sequential storage structure:
For example, arrays, 1-2-3-4-5-6-7-8-9-10, are stored in order. Then there are stacks and queues
- Chain storage structure:
Arrays, for example, the 1-2-3-4-5-6-4-5-6-10, the chain store is different (address) (1-2 (address) to 7 (address) (address) – 4-5 (address) – 9 (address) to 8 (address) – 3-6 (address) (address) to 10 (address). Each number is followed by an address and stored no longer sequentially
2. Linear structure Tree structure graph structure
- The collection structure
A set, which is a circle with a bunch of elements, has nothing to do with each other and that’s easy
- Linear structure
There are a lot of people on a line. This line doesn’t have to be straight. It can also be curved. It can also be the equivalent of a line broken into several segments (use your imagination). Linear structure is a one-to-one relationship
- A tree structure
Developers must be more or less aware that XML parsing trees are very similar to them. Or you can think of it as a pyramid. The tree structure is a one-to-many relationship
- Graph structure
This is a little bit more complicated. There is no end to him. Infinitesimally undirected (no direction) graphic mechanism you can think of as many-to-many similar to the intersection of our human relationships
Common algorithms
Foundation
UIKit
WebView
Write a singleton
Memory management
The messaging
Network related
Data is stored
multithreading
The core of animation
The image processing
Data security and encryption
Runtime
Runloop
Block
Category
The project architecture
Design patterns
componentization
Debugging technique
Performance optimization
The source code to understand
Code management
Continuous integration
Juejin. Cn/post / 684490… Juejin. Cn/post / 684490…