<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[孑澈的专栏]]></title><description><![CDATA[境由心生]]></description><link>https://blog.youkuaiyun.com/jieche01</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jieche01]]></copyright><item><title><![CDATA[QT编译报错无法解析的外部符号]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/115377821</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/115377821</guid><author>jieche01</author><pubDate>Thu, 01 Apr 2021 16:38:16 +0800</pubDate><description><![CDATA[QT编译报错无法解析的外部符号
特征

头文件，有几个槽函数，提示有多少个无法解析的外部符号
注释掉宏Q_OBJECT，可以编译通过

可能原因
1.对应的cpp文件没有加入项目中
2.cpp文件，右键属性，为 自定义工具，没有进行编译，修改为c/c++工具即可

...]]></description><category></category></item><item><title><![CDATA[模板型模板参数报错，无法调试通过，---《深入实践c++模板》例子]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/105890596</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/105890596</guid><author>jieche01</author><pubDate>Sat, 02 May 2020 15:02:45 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;

using namespace std;

template&lt;typename T ,void (*f)(T&amp; v)&gt;
void foreach_0(T arr[], unsigned size)
{
	for (size_t i = 0; i &lt; size; i++)
	{
		f(arr[i]);
	}
 }

te...]]></description><category></category></item><item><title><![CDATA[函数模板简单实现]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/105889254</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/105889254</guid><author>jieche01</author><pubDate>Sat, 02 May 2020 12:56:35 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;

using namespace std;

template&lt;typename T ,void (*f)(T&amp; v)&gt;
void foreach(T arr[], unsigned size)
{
	for (size_t i = 0; i &lt; size; i++)
	{
		f(arr[i]);
	}
 }

tem...]]></description><category></category></item><item><title><![CDATA[QT实现实时增加 删除 读取 XML文件]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/84575813</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/84575813</guid><author>jieche01</author><pubDate>Tue, 27 Nov 2018 23:52:47 +0800</pubDate><description><![CDATA[QT实现实时增加 删除 读取 XML文件头文件源文件
头文件
#ifndef OPERATEXML_H
#define OPERATEXML_H

#include &amp;lt;QtWidgets/QMainWindow&amp;gt;
#include &amp;lt;QStringListModel&amp;gt;
#include &amp;lt;QStandardItemModel&amp;gt;
#include &amp;lt;QMod...]]></description><category></category></item><item><title><![CDATA[插入排序-----希尔排序---升级版插入]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/61614610</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/61614610</guid><author>jieche01</author><pubDate>Sun, 12 Mar 2017 10:03:18 +0800</pubDate><description><![CDATA[插入排序-----希尔排序---升级版插入]]></description><category></category></item><item><title><![CDATA[网络编程--udp--客户端--服务端--Socket]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53836473</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53836473</guid><author>jieche01</author><pubDate>Fri, 23 Dec 2016 10:37:12 +0800</pubDate><description><![CDATA[网络编程--udp--客户端--服务端--Socket]]></description><category></category></item><item><title><![CDATA[顺序线性表——通过存放地址，实现顺序存储--C语言简单实现]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53761876</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53761876</guid><author>jieche01</author><pubDate>Tue, 20 Dec 2016 13:21:13 +0800</pubDate><description><![CDATA[顺序线性表——通过存放地址，实现顺序存储--C语言简单实现]]></description><category></category></item><item><title><![CDATA[C语言  简单链式哈希]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53610071</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53610071</guid><author>jieche01</author><pubDate>Tue, 13 Dec 2016 15:20:09 +0800</pubDate><description><![CDATA[C语言  简单链式哈希]]></description><category></category></item><item><title><![CDATA[哈希表  c语言简单实现]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53608824</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53608824</guid><author>jieche01</author><pubDate>Tue, 13 Dec 2016 13:50:06 +0800</pubDate><description><![CDATA[哈希表  简单实现]]></description><category></category></item><item><title><![CDATA[二叉树的节点删除]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53587886</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53587886</guid><author>jieche01</author><pubDate>Mon, 12 Dec 2016 20:56:04 +0800</pubDate><description><![CDATA[二叉树的节点删除]]></description><category></category></item><item><title><![CDATA[二叉树，建立，查询，删除，插入的简单实现]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53584616</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53584616</guid><author>jieche01</author><pubDate>Mon, 12 Dec 2016 16:42:16 +0800</pubDate><description><![CDATA[二叉树，建立，查询，删除，插入的简单实现]]></description><category></category></item><item><title><![CDATA[函数指针    typedef 用法 回调函数  结构体存储函数地址]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53584578</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53584578</guid><author>jieche01</author><pubDate>Mon, 12 Dec 2016 16:40:14 +0800</pubDate><description><![CDATA[函数指针    typedef 用法 回调函数  结构体存储函数地址]]></description><category></category></item><item><title><![CDATA[冒泡排序，插入排序，快速排序，归并排序，堆排序，选择排序，希尔排序]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53561137</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53561137</guid><author>jieche01</author><pubDate>Sat, 10 Dec 2016 21:20:44 +0800</pubDate><description><![CDATA[冒泡排序，插入排序，快速排序，归并排序，堆排序，选择排序]]></description><category></category></item><item><title><![CDATA[c语言简单创建二叉树]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53560517</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53560517</guid><author>jieche01</author><pubDate>Sat, 10 Dec 2016 19:47:29 +0800</pubDate><description><![CDATA[c语言简单创建二叉树]]></description><category></category></item><item><title><![CDATA[c语言简单实现 冒泡，插入，选择，归并排序]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53559466</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53559466</guid><author>jieche01</author><pubDate>Sat, 10 Dec 2016 16:42:36 +0800</pubDate><description><![CDATA[c语言简单实现 冒泡，插入，选择，归并排序]]></description><category></category></item><item><title><![CDATA[c语言简单递归/非递归实现二分查找]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53523360</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53523360</guid><author>jieche01</author><pubDate>Thu, 08 Dec 2016 19:49:10 +0800</pubDate><description><![CDATA[c语言简单递归/非递归实现二分查找]]></description><category></category></item><item><title><![CDATA[c语言简单实现队列]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53508627</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53508627</guid><author>jieche01</author><pubDate>Wed, 07 Dec 2016 17:25:14 +0800</pubDate><description><![CDATA[c语言简单实现队列]]></description><category></category></item><item><title><![CDATA[括号匹配---栈实现]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53507190</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53507190</guid><author>jieche01</author><pubDate>Wed, 07 Dec 2016 15:55:23 +0800</pubDate><description><![CDATA[括号匹配]]></description><category></category></item><item><title><![CDATA[链表简单实现---栈]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53493045</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53493045</guid><author>jieche01</author><pubDate>Tue, 06 Dec 2016 20:44:10 +0800</pubDate><description><![CDATA[#include <stdio.h>
#include <string.h>
#include "stack_list.h"
//栈应用 , 检查字符串中括号是否匹配void test1()////内部功能Pnode createNode(DataType data)
{
    Pnode p1 = createNode(1);
    Pnode p2 = createNode(2);]]></description><category></category></item><item><title><![CDATA[问题：求两个字符串的最长公共子串。 要求：输入两个字符串，输出它们的最长公共子串，包括长度。 设计： 设计一个类 String,包括一个 len（字符串长度）和字符串指针 s。另有如下成员函数： ·]]></title><link>https://blog.youkuaiyun.com/jieche01/article/details/53492871</link><guid>https://blog.youkuaiyun.com/jieche01/article/details/53492871</guid><author>jieche01</author><pubDate>Tue, 06 Dec 2016 20:32:49 +0800</pubDate><description><![CDATA[问题：求两个字符串的最长公共子串。
要求：输入两个字符串，输出它们的最长公共子串，包括长度。
设计：
设计一个类 String,包括一个 len（字符串长度）和字符串指针 s。另有如下成员函数：
· void getstring() 从用户获取一个字符串。
· void display() 输出字符串。
· friend String maxsubstring(String str1,String str2) 友元函数，求两个字符串的最长
公共子串]]></description><category></category></item></channel></rss>