<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_47799731的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_47799731</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_47799731]]></copyright><item><title><![CDATA[php脚本连接mysql，微信小程序连接数据库。]]></title><link>https://blog.youkuaiyun.com/qq_47799731/article/details/130297944</link><guid>https://blog.youkuaiyun.com/qq_47799731/article/details/130297944</guid><author>qq_47799731</author><pubDate>Sat, 29 Apr 2023 11:00:59 +0800</pubDate><description><![CDATA[最近我在做一个微信小程序，其中有一个页面，页面里面需要连接我的后台数据库，把用户数据传递到我的MySQL数据库中。最初，我在网上找了很多东西，发现并没有一个特别详细明确的教程，其中大多数都只是把他的代码给出来。该函数需要使用一个微信小程序的一个api接口：wx.request。这里我使用的是宝塔面板帮助我搭建的网站。其中的data是用来传递参数的，后台的PHP脚本会有$_GET变量来获取传递的参数。下面是这个界面的实现的代码senddata.ts。后台脚本写好之后便可以实现和后台数据库的连接。]]></description><category></category></item><item><title><![CDATA[王道线性表-递归删除元素的理解。]]></title><link>https://blog.youkuaiyun.com/qq_47799731/article/details/124232364</link><guid>https://blog.youkuaiyun.com/qq_47799731/article/details/124232364</guid><author>qq_47799731</author><pubDate>Sun, 17 Apr 2022 17:05:38 +0800</pubDate><description><![CDATA[void del_list(LinkList *&amp;L, ElemType x) {
    LNode *p = (LNode *)malloc(sizeof(LNode));
    if (L == NULL) {
        return;
    }
    if (L-&gt;data == x) {
        p = L;
        L = L-&gt;next;  //不用访问前驱节点，怎么做到不断链的删除节点
        free(p);
        del.]]></description><category></category></item><item><title><![CDATA[队列的链式和顺序实现方法]]></title><link>https://blog.youkuaiyun.com/qq_47799731/article/details/123938892</link><guid>https://blog.youkuaiyun.com/qq_47799731/article/details/123938892</guid><author>qq_47799731</author><pubDate>Sun, 03 Apr 2022 15:54:12 +0800</pubDate><description><![CDATA[边学边写，督促自己。C++实现队列的顺序和链式方法。]]></description><category></category></item><item><title><![CDATA[C++顺序表（不定时更新完善）]]></title><link>https://blog.youkuaiyun.com/qq_47799731/article/details/123141821</link><guid>https://blog.youkuaiyun.com/qq_47799731/article/details/123141821</guid><author>qq_47799731</author><pubDate>Fri, 25 Feb 2022 21:53:53 +0800</pubDate><description><![CDATA[#pragma once
#include&lt;iostream&gt;
using namespace std;
template&lt;typename Datatype&gt;
struct ordinalList
{
	Datatype* a;
	int max_size;
	int passing_size;
};
template&lt;typename  Datatype&gt;
class OrdinalList
{
public:
	
	ordinalList&lt; Datatype.]]></description><category></category></item><item><title><![CDATA[C++链表(一边写一边更新）]]></title><link>https://blog.youkuaiyun.com/qq_47799731/article/details/123069995</link><guid>https://blog.youkuaiyun.com/qq_47799731/article/details/123069995</guid><author>qq_47799731</author><pubDate>Tue, 22 Feb 2022 15:48:53 +0800</pubDate><description><![CDATA[list.h


#pragma once
#include&lt;iostream&gt;
using namespace std;
template &lt;typename Datatype&gt;
struct tree
{
	Datatype data;
	tree* next;
};
template &lt;typename Datatype&gt;
class Tree
{
public:
	void create(tree&lt;Datatype&gt;* &amp;L)
	{
		L .]]></description><category></category></item></channel></rss>