This is a mind map about data and data structure. The main contents include: Chapter 6: Composition of data in the era of big data, Chapter 5: Data structure and algorithm, Chapter 4: Tree, Chapter 3: String , queue and stack, Chapter 2: Arrays and linked lists, Chapter 1: Data and data organization.
Edited at 2024-02-13 18:50:35"九品小吏絕地逆襲!大唐'荔枝使'李善德被迫接下五千里的生死速遞貴妃生辰前,嶺南鮮荔枝必須抵達長安!面對同僚陷害、時限催命,他聯合胡商會長阿彌塔、臥底侍郎鄭平安,在左相暗線雲清與波斯商人蘇諒的助力下,以精密路線與冰鎮秘術搏一線生機。'退無可退,便向死而生!'這場跨越山海的味道爭奪戰,背後竟藏著右相貪污的驚天秘密……"一張圖給你解釋清楚,李善德和其他角色之間的關係。
這張解析圖從四個維度闡釋了《長安的荔枝》中荔枝必須從嶺南運輸的原因: 1、氣候條件:嶺南熱量充足、降水適中、光照適宜,特別適合荔枝生長,尤其是晚熟品種(如“糯米糍”),能保證果實品質細膩甘甜,而北方氣候寒冷乾燥,無法種植優質荔枝。 2、歷史傳承:嶺南荔枝種植歷史悠久,品種改良技術成熟,從“龍子笑”到“烏欖”等名貴品種,積累了豐富的栽培經驗,形成了穩定的供應鏈。 3、運輸挑戰:唐代無冷鏈技術,荔枝保鮮極難,需12小時內採摘並日夜兼程運送,依賴驛站(如“荔枝古道”)和快馬體系,突顯物流難度。 4、政治象徵:楊貴妃的偏好使嶺南荔枝成為權力像徵,唐玄宗不惜耗費國力(如“九十萬馬匹”)完成運輸,暴露統治者的奢靡與製度弊端。
大唐年間,九品小吏李善德在同僚的欺瞞之下從監事變身“荔枝使”,被迫接下一道為賀貴妃生辰、需從嶺南運送新鮮荔枝到長安的“死亡”任務,荔枝“一日色變,兩日香變,三日味變”,而嶺南距長安五千餘里,山水迢迢,這是個不可能完成的任務。且看李善德如何千里送荔枝鮮!
"九品小吏絕地逆襲!大唐'荔枝使'李善德被迫接下五千里的生死速遞貴妃生辰前,嶺南鮮荔枝必須抵達長安!面對同僚陷害、時限催命,他聯合胡商會長阿彌塔、臥底侍郎鄭平安,在左相暗線雲清與波斯商人蘇諒的助力下,以精密路線與冰鎮秘術搏一線生機。'退無可退,便向死而生!'這場跨越山海的味道爭奪戰,背後竟藏著右相貪污的驚天秘密……"一張圖給你解釋清楚,李善德和其他角色之間的關係。
這張解析圖從四個維度闡釋了《長安的荔枝》中荔枝必須從嶺南運輸的原因: 1、氣候條件:嶺南熱量充足、降水適中、光照適宜,特別適合荔枝生長,尤其是晚熟品種(如“糯米糍”),能保證果實品質細膩甘甜,而北方氣候寒冷乾燥,無法種植優質荔枝。 2、歷史傳承:嶺南荔枝種植歷史悠久,品種改良技術成熟,從“龍子笑”到“烏欖”等名貴品種,積累了豐富的栽培經驗,形成了穩定的供應鏈。 3、運輸挑戰:唐代無冷鏈技術,荔枝保鮮極難,需12小時內採摘並日夜兼程運送,依賴驛站(如“荔枝古道”)和快馬體系,突顯物流難度。 4、政治象徵:楊貴妃的偏好使嶺南荔枝成為權力像徵,唐玄宗不惜耗費國力(如“九十萬馬匹”)完成運輸,暴露統治者的奢靡與製度弊端。
大唐年間,九品小吏李善德在同僚的欺瞞之下從監事變身“荔枝使”,被迫接下一道為賀貴妃生辰、需從嶺南運送新鮮荔枝到長安的“死亡”任務,荔枝“一日色變,兩日香變,三日味變”,而嶺南距長安五千餘里,山水迢迢,這是個不可能完成的任務。且看李善德如何千里送荔枝鮮!
Data and data structures
Chapter 1: Data and Data Organization
data
Numbers: They have no meaning in themselves and have no quantitative meaning. They only have specific practical meaning in specific situations.
Numeric value: data composed of numerical symbols, with quantitative meaning, and capable of arithmetic operations
Data organization
Data element: the basic unit of data
Data types: basic data types and structural data types
Data structure: the relationship between data, that is, the organization form of data
Chapter 2: Arrays and Linked Lists
array
Concept: a sequence composed of variables of the same type
One-dimensional array: suitable for representing data sequences with linear characteristics
characteristic
Array elements have the same data type
Access the value of array elements through array name and subscript
Store empty fixed space
linked list
Concept: A data structure that connects data objects that need to be processed in the form of nodes through pointers.
characteristic
The structure of each node in the same linked list is the same
Each linked list must have a head pointer to implement reference and boundary processing of the linked list
The space occupied by the linked list is not fixed
Chapter 3: Strings, Queues and Stacks
string
Concept: A finite sequence of zero or more characters
characteristic
finite seriality
String comparability
queue
Concept: A first-in, first-out linear list. The end that allows insertion is called the tail of the queue, and the end that allows deletion is called the head of the queue.
characteristic
First in, first out, last in, last out
finite seriality
stack
Concept: A linear table with restricted operations, allowing insertion or deletion only at one end of the table
characteristic
First in, last out, last in, first out
finite seriality
Chapter 4: Tree
Trees and Binary Trees
The concept of tree: It can be described as a finite set composed of n (n>=0) nodes and a node relationship defined on the set.
The concept of a binary tree: it is a finite set with n nodes
Binary tree properties
There are at most 2 k-1 power nodes on the kth layer.
A binary tree with depth k has at most 2 k - 1 nodes.
n0=n2 1
Basic operations of binary trees
Complete binary tree and incomplete binary tree
Traverse
Preorder traversal: around the root
In-order traversal: left root right
Postorder traversal: left and right roots
abstract data type
Chapter 5: Data Structures and Algorithms
Iteration and recursion
The concept of iteration; an activity that repeats a feedback process, usually with the goal of bringing results in line with goal expectations
Data sorting
Bubble Sort
Data lookup
sequential search
binary search
Chapter 6: Composition of data in the era of big data
Organization of data in real-time query systems
Organization and application of POI data