线性表（顺序表）——C语言版

缺乏、安全感 2023-07-13 00:53 93阅读 0赞

## 线性表的插入 ##

--------------------

## 静态插入 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 1]

//线性表——顺序表
    #include<stdio.h>
    //方法一：结构体(静态分配)
    #include<stdbool.h>
    #define MaxSize 10
    typedef struct
    { 
    	int data[MaxSize];
    	int length;
    }SqList;
    void chushihua(SqList& L)
    { 
    	L.length = 0;
    	for (int i = 0; i < MaxSize; i++)
    	{ 
    		L.data[i] = 0; 
    	}
    }
    bool ListInsert(SqList& L, int k, int n)
    { 
    	if (k<1 || k>L.length+1) return false;
    	if (L.length >= MaxSize) return false;
    	for (int j =L.length;j>=k;j--)
    	{ 
    		L.data[j] = L.data[j-1];	
    	}
    	L.data[k-1] = n;
    	L.length++;
    	return true;
    }
    void main()
    { 
    	SqList L;
    	int n;
    	int k;
    	chushihua(L);
    	for (int i = 0; i < 5; i++)
    	{ 
    		L.data[i] = i;
    		L.length++;
    	}
    	printf("请输入一个数：");
    	scanf_s("%d", &n);
    	printf("输入在哪里插入：");
    	scanf_s("%d",&k);
    	
    	//插入:
    	bool Sure_No = ListInsert(L, k, n);
    	if (Sure_No)
    	{ 
    		for(int i=0;i<L.length;i++)
    		{ 
    			printf("%d ",L.data[i]); 
    		}		
    		printf("\n");
    		printf("%d",L.length);
    	}
    	else { 
    		printf("错了");
    	}
    
     }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 2]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 3]  
“*★,°*:.☆(￣▽￣)/$:*.°★* 。”–下面是完整版

//顺序表静态插入算法
    //#include<stdlib.h>
    #include<stdio.h>
    # define MaxSize 10//占了十个座int* data;//一个指针
    typedef struct { 
    	int data[MaxSize];
    	int length;//这是表的元素的个数，坐下来的人数
    }sqlist;
    void chushihua(sqlist &L)//初始化了一个表L.data = (int*)malloc(InitSize * sizeof(int));//占了十个座
    { 
    	L.length = 0;//表的长度，最开始一个人也没来L.maxsize = InitSize;//表的最大容量-占的十个座
    }
    bool charu(sqlist &L, int i, int a)
    { 
    	if (i<i||i>L.length+1)return false;
    	if (L.length == MaxSize)
    	{ 
    		printf("满了,");
    		return false;
    	}
    	else//开始插入 
    	{ 
    		for (int j = L.length; j >= i; j--)
    		{ 
    			L.data[j] = L.data[j - 1];
    		}
    		L.data[i - 1] = a;
    		L.length++;
    		return true;
    	}
    }
    
    int main()
    { 
    	sqlist L;
    	chushihua(L);
    	for (int i = 0; i < 5; i++)//来了五个人坐下了，表中有五个人
    	{ 
    		L.data[i] = i;
    		L.length++;
    	}
    	printf("插入前：\n");
    	for (int i = 0; i < L.length; i++)
    	{ 
    		printf("%d ",L.data[i]);
    	}
    	printf("\n");
    	printf("表长：%d\n",L.length);
    	printf("表的最大长度是：%d\n", MaxSize);
    	printf("-----------------开始插了--------------------\n");
    	bool a=charu(L, 3, 66);
    	if (a == false) printf("插入失败\n");
    	if (a == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ",L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", MaxSize);
    	printf("-----------------再次插入--------------------\n");
    	bool b = charu(L, 4, 99);
    	if (b == false) printf("插入失败");
    	if (b == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", MaxSize);
    	printf("-----------------又来啦--------------------\n");
    	bool c = charu(L, 7, 22);
    	if (c == false)printf("插入失败");
    	if (c == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", MaxSize);
    	printf("-----------------我继续--------------------\n");
    	bool d = charu(L, 5, 77);
    	if (d == false)printf("插入失败");
    	if (d == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", MaxSize);
    	printf("-----------------最后一个--------------------\n");
    	bool e = charu(L, 7, 100);
    	if (e == false)printf("插入失败");
    	if (e == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", MaxSize);
    	printf("-----------------失败的--------------------\n");
    	bool f = charu(L, 7, 404);
    	if (f == false)printf("插入失败\n");
    	if (f == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", MaxSize);
    	return 0;
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 4]

--------------------

**动态插入**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 5]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 6]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 7]  
(　o=^•ェ•)o　┏━┓–下面是完整版

//顺序表动态
    #include<stdlib.h>
    #include<stdio.h>
    # define MaxSize 10//占了十个座
    typedef struct { 
    	int *data;//一个指针
    	int length;//这是表的元素的个数，坐下来的人数
    	int maxsize;
    }sqlist;
    void chushihua(sqlist &L)//初始化了一个表
    { 
    	L.data = (int*)malloc(MaxSize * sizeof(int));//占了十个座,指针指向第一个座位开始处
    	L.length = 0;//表的长度，最开始一个人也没来
    	L.maxsize = MaxSize;//表的最大容量-占的十个座
    }
    bool zengjia(sqlist &L, int len)
    { 
    	int* p = L.data;
    	L.data = (int*)malloc((L.maxsize + len) * sizeof(int));//新建了个数组
    	for (int i = 0; i < L.length; i++)
    	{ 
    		L.data[i] = p[i];
    	}
    	L.maxsize = L.maxsize + len;
    	free(p);
    	return true;
    }
    
    bool charu(sqlist &L, int i, int a)
    { 
    	if (i<i||i>L.length+1)return false;
    	if (L.length == MaxSize)
    	{ 
    		printf("满了,");
    		bool zeng=zengjia(L, 5);
    		if (zeng == true)
    		{ //开始插入
    			for (int j = L.length; j >= i; j--)
    			{ 
    				L.data[j] = L.data[j - 1];
    			}
    			L.data[i - 1] = a;
    			L.length++;
    			return true;
    		}
    	}
    	else//开始插入 
    	{ 
    		for (int j = L.length; j >= i; j--)
    		{ 
    			L.data[j] = L.data[j - 1];
    		}
    		L.data[i - 1] = a;
    		L.length++;
    		return true;
    	}
    }
    
    int main()
    { 
    	sqlist L;
    	chushihua(L);
    	for (int i = 0; i < 5; i++)//来了五个人坐下了，表中有五个人
    	{ 
    		L.data[i] = i;
    		L.length++;
    	}
    	printf("插入前：\n");
    	for (int i = 0; i < L.length; i++)
    	{ 
    		printf("%d ",L.data[i]);
    	}
    	printf("\n");
    	printf("表长：%d\n",L.length);
    	printf("表的最大长度是：%d\n", L.maxsize);
    	printf("-----------------开始插了--------------------\n");
    	bool a=charu(L, 3, 66);
    	if (a == false) printf("插入失败\n");
    	if (a == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ",L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", L.maxsize);
    	printf("-----------------再次插入--------------------\n");
    	bool b = charu(L, 4, 99);
    	if (b == false) printf("插入失败");
    	if (b == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", L.maxsize);
    	printf("-----------------又来啦--------------------\n");
    	bool c = charu(L, 7, 22);
    	if (c == false)printf("插入失败");
    	if (c == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", L.maxsize);
    	printf("-----------------我继续--------------------\n");
    	bool d = charu(L, 5, 77);
    	if (d == false)printf("插入失败");
    	if (d == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", L.maxsize);
    	printf("-----------------最后一个--------------------\n");
    	bool e = charu(L, 7, 100);
    	if (e == false)printf("插入失败");
    	if (e == true)
    	{ 
    		printf("插入成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", L.maxsize);
    	printf("-----------------失败的--------------------\n");
    	bool f = charu(L, 7, 404);
    	if (f == false)printf("插入失败\n");
    	if (f == true)
    	{ 
    		printf("插入成功！,增加成功！\n");
    		for (int i = 0; i < L.length; i++)
    		{ 
    			printf("%d ", L.data[i]);
    		}
    		printf("\n");
    	}
    	printf("现在表的长度是：%d\n", L.length);
    	printf("现在表的最大长度是：%d\n", L.maxsize);
    
    	return 0;
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 8]

--------------------

## 线性表的删除 ##

删除就是从被删的那个数起，到表尾，一个一个向前覆盖。

//线性表——顺序表
    #include<stdio.h>
    #include<stdbool.h>
    /* 方法一：结构体(静态分配) #define MaxSize 10 typedef struct { int data[MaxSize]; int length; }SqList; */
    //方法二：结构体（动态分配）
    #include<stdlib.h>
    #define MaxSize 10
    typedef struct
    { 
    	int* data;
    	int length;
    	int maxsize;
    }SqList;
    
    void chushihua(SqList& L)
    { 
    	L.length = 0;
    	L.data= (int*)malloc(MaxSize* sizeof(int));
    	/*for (int i = 0; i < MaxSize; i++) { L.data[i] = 0; }*/
    	L.maxsize = MaxSize;
    }
    bool zengjia(SqList& L, int len)
    { 
    	int* p = L.data;
    	L.data = (int*)malloc((L.maxsize + len) * sizeof(int));
    	for (int i = 0; i < L.length; i++)
    	{ 
    		L.data[i] = p[i];
    	}
    	free(p);
    	return true;
    }
    bool ListInsert(SqList& L, int k, int n)
    { 
    	if (k<1 || k>L.length+1)return false;
    	if (L.length >= L.maxsize)
    	{ 
    		printf("表满了，现在开始扩充表");
    		bool zeng = zengjia(L,5);
    		if (zeng)
    		{ 
    			printf("增加成功，现在开始插入");
    			for (int j = L.length; j >= k; j--)
    			{ 
    				L.data[j] = L.data[j - 1];
    			}
    			L.data[k - 1] = n;
    			L.length++;
    			return true;
    		}
    	}
    	for (int j = L.length; j >= k; j--)
    	{ 
    		L.data[j] = L.data[j-1];
    	}
    	L.data[k - 1] = n;
    	L.length++;
    	return true;
    }
    bool ListDelete(SqList& L, int w, int& e)
    { 
    	if (w<1 || w>L.length+1)return false;
    	if (w >= L.maxsize)return false;
    	e = L.data[w - 1];
    	for (int i = w; i < L.length; i++)
    	{ 
    		L.data[i - 1] = L.data[i];
    	}
    	L.length--;
    	return true;
    }
    void main()
    { 
    	SqList L;
    	int n;
    	int k;
    	chushihua(L);
    	for (int i = 0; i < 5; i++)
    	{ 
    		L.data[i] = i;
    		L.length++;
    	}
    	printf("请输入一个数：");
    	scanf_s("%d", &n);
    	printf("输入在哪里插入：");
    	scanf_s("%d",&k);
    	
    	//插入:
    	bool Sure_No = ListInsert(L, k, n);
    	if (Sure_No)
    	{ 
    		printf("插入成功！\n");
    		for(int i=0;i<L.length;i++)
    		{ 
    			printf("%d ",L.data[i]); 
    		}		
    		printf("\n");
    		printf("表长：%d\n",L.length);
    	}
    	else { 
    		printf("错了");
    	}
    	printf("现在开始删除了");
    	int w;
    	int e;//带回来的值
    	printf("你想删第几个：");
    	scanf_s("%d", &w);
    	bool Delete = ListDelete(L, w, e);
    	if (Delete)
    	{ 
    		printf("删除成功，被删掉的数是：%d\n",e);
    	}
    	for (int i = 0; i < L.length; i++)
    	{ 
    		printf("%d ",L.data[i]);
    	}
     }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 9]

--------------------

## 查找——按值查找，并且返回找到的元素的位序 ##

int Find = LocateElem(L, e);
    -------------------------------------
    int LocateElem(SqList& L, int e)
    { 
    	for (int i = 0; i < L.length; i++)
    	{ 
    		if (L.data[i] == e) return i+1;
    	}
    	return 0;
    }

( ఠൠఠ )ﾉ完整版

//线性表——顺序表
    #include<stdio.h>
    #include<stdbool.h>
    /* 方法一：结构体(静态分配) #define MaxSize 10 typedef struct { int data[MaxSize]; int length; }SqList; */
    //方法二：结构体（动态分配）
    #include<stdlib.h>
    #define MaxSize 10
    typedef struct
    { 
    	int* data;
    	int length;
    	int maxsize;
    }SqList;
    
    void chushihua(SqList& L)
    { 
    	L.length = 0;
    	L.data= (int*)malloc(MaxSize* sizeof(int));
    	/*for (int i = 0; i < MaxSize; i++) { L.data[i] = 0; }*/
    	L.maxsize = MaxSize;
    }
    bool zengjia(SqList& L, int len)
    { 
    	int* p = L.data;
    	L.data = (int*)malloc((L.maxsize + len) * sizeof(int));
    	for (int i = 0; i < L.length; i++)
    	{ 
    		L.data[i] = p[i];
    	}
    	free(p);
    	return true;
    }
    bool ListInsert(SqList& L, int k, int n)
    { 
    	if (k<1 || k>L.length+1)return false;
    	if (L.length >= L.maxsize)
    	{ 
    		printf("表满了，现在开始扩充表");
    		bool zeng = zengjia(L,5);
    		if (zeng)
    		{ 
    			printf("增加成功，现在开始插入");
    			for (int j = L.length; j >= k; j--)
    			{ 
    				L.data[j] = L.data[j - 1];
    			}
    			L.data[k - 1] = n;
    			L.length++;
    			return true;
    		}
    	}
    	for (int j = L.length; j >= k; j--)
    	{ 
    		L.data[j] = L.data[j-1];
    	}
    	L.data[k - 1] = n;
    	L.length++;
    	return true;
    }
    bool ListDelete(SqList& L, int w, int& e)
    { 
    	if (w<1 || w>L.length+1)return false;
    	if (w >= L.maxsize)return false;
    	e = L.data[w - 1];
    	for (int i = w; i < L.length; i++)
    	{ 
    		L.data[i - 1] = L.data[i];
    	}
    	L.length--;
    	return true;
    }
    int LocateElem(SqList& L, int e)
    { 
    	for (int i = 0; i < L.length; i++)
    	{ 
    		if (L.data[i] == e) return i+1;
    	}
    	return 0;
    }
    void main()
    { 
    	SqList L;
    	int n;
    	int k;
    	chushihua(L);
    	for (int i = 0; i < 5; i++)
    	{ 
    		L.data[i] = i;
    		L.length++;
    	}
    	printf("请输入一个数：");
    	scanf_s("%d", &n);
    	printf("输入在哪里插入：");
    	scanf_s("%d",&k);
    	
    	//插入:
    	bool Sure_No = ListInsert(L, k, n);
    	if (Sure_No)
    	{ 
    		printf("插入成功！\n");
    		for(int i=0;i<L.length;i++)
    		{ 
    			printf("%d ",L.data[i]); 
    		}		
    		printf("\n");
    		printf("表长：%d\n",L.length);
    	}
    	else { 
    		printf("错了");
    	}
    	printf("现在开始删除了");
    	int w;
    	int e;//带回来的值
    	printf("你想删第几个：");
    	scanf_s("%d", &w);
    	bool Delete = ListDelete(L, w, e);
    	if (Delete)
    	{ 
    		printf("删除成功，被删掉的数是：%d\n",e);
    	}
    	for (int i = 0; i < L.length; i++)
    	{ 
    		printf("%d ",L.data[i]);
    	}
    	printf("\n");
    	printf("现在开始查找——按值查找\n");
    	printf("请输入想查找的元素：");
    	scanf_s("%d",&e);
    	int Find = LocateElem(L, e);
    	printf("你要查找的位序是：%d",Find);
     }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 10]

--------------------

## 按位查找 ##

int Find_wei = GetElem(L, e);
    ------------------------------------
    int GetElem(SqList& L, int e)
    { 
    	return L.data[e-1];
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 11]  
\`

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/2020072509273691.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 1]: https://img-blog.csdnimg.cn/20200310115046559.PNG?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 2]: https://img-blog.csdnimg.cn/20200723105520966.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 3]: https://img-blog.csdnimg.cn/20200723102649658.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 4]: https://img-blog.csdnimg.cn/20200723122521334.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 5]: https://img-blog.csdnimg.cn/20200723120941179.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 6]: https://img-blog.csdnimg.cn/20200723122054222.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 7]: https://img-blog.csdnimg.cn/20200723122116707.PNG?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 8]: https://img-blog.csdnimg.cn/20200723122336324.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 9]: https://img-blog.csdnimg.cn/20200723125803688.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 10]: https://img-blog.csdnimg.cn/20200725093058161.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70 11]: https://img-blog.csdnimg.cn/20200725111903311.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky,size_16,color_FFFFFF,t_70