<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zpcdcsdn的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zpcdcsdn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zpcdcsdn]]></copyright><item><title><![CDATA[基于东北F4的设计模式情景剧——第一幕 装饰模式(Decorator Pattern)]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/52711452</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/52711452</guid><author>zpcdcsdn</author><pubDate>Sat, 08 Oct 2016 16:33:52 +0800</pubDate><description><![CDATA[虚拟一个应用场景，通过情景化的讲述方式，随着故事情节的展开，逐步引出装饰模式的产生原因、应用场景、运作机理、优势及局限性等方面的知识。不是生搬硬套地讲述概念和条条框框，而是通过一种情景化的描述，层层深入，使读者自然而然地对装饰模式有一个具象的、贴近现实应用的认识，进而达到使读者深入理解装饰模式的目的。]]></description><category></category></item><item><title><![CDATA[话说C++中的左值、纯右值、将亡值]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/50850550</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/50850550</guid><author>zpcdcsdn</author><pubDate>Mon, 14 Mar 2016 18:19:58 +0800</pubDate><description><![CDATA[本文详细介绍了C++11中表达式的值类别——左值、纯右值、将亡值。文章指明了各个值类别的特征，同时对常见表达式的值类别进行了归纳。在文章的最后，指出了“三值”中需要大家特别注意的问题。本文在参考大量资料的基础上，加入了作者自己的理解，旨在把话说明白，让读者对“三值”问题有一个清晰的认识。]]></description><category></category></item><item><title><![CDATA[C++实现有向权图的基本操作，界面友好，操作方便，运行流畅]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/41264335</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/41264335</guid><author>zpcdcsdn</author><pubDate>Wed, 19 Nov 2014 00:26:01 +0800</pubDate><description><![CDATA[Ⅰ.功能： 
          1.创建图 
          2.展示全图 
          3.添加顶点 
          4.添加边 
          5.删除顶点 
          6.删除边 
          7.查看指定边权值 
          8.修改指定边权值 
          9.输出两点间的所有简单路及路径对应权值 
    ]]></description><category></category></item><item><title><![CDATA[C++实现顺序栈，运用模板，界面友好，操作方便，运行流畅]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40684933</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40684933</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 21:03:57 +0800</pubDate><description><![CDATA[﻿﻿
//.h文件
#ifndef STACK_H
#define STACK_H
#include
template 
class Stack
{
private:
 T* array;
 int size;
 int top;
private:
bool Push(const T& item);
bool Pop(T& item);
bool Creat(cons]]></description><category></category></item><item><title><![CDATA[C语言实现数组快速排序（含对算法的详细解释）]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40683169</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40683169</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 18:59:37 +0800</pubDate><description><![CDATA[/*
说明：


*/]]></description><category></category></item><item><title><![CDATA[C语言实现单向链表及其各种排序（含快排，选择，插入，冒泡）]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40682675</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40682675</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 18:41:05 +0800</pubDate><description><![CDATA[﻿﻿
#include
#include
#define LEN sizeof(struct Student)
struct Student                //结构体声明
{
 long num;
 int score;
 struct Student* next;
};
int n;
struct Student* creat()
{
 struct S]]></description><category></category></item><item><title><![CDATA[C++，数据结构，单向链表的实现及简单运用，运用模板]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40681791</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40681791</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 16:38:36 +0800</pubDate><description><![CDATA[/*
说明：
代码功能：


*/]]></description><category></category></item><item><title><![CDATA[C++，利用链式栈实现括号匹配，界面友好，操作方便，运行流畅]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40681601</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40681601</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 16:28:49 +0800</pubDate><description><![CDATA[﻿﻿
#include
#include
using namespace std;
struct Node
{
 char ch;
 Node* next;
 Node(char c, Node* p){ ch = c; next = p; }
};
void main()
{
 string str;
 bool flag = true;
 while (flag)]]></description><category></category></item><item><title><![CDATA[C++实现链式栈，运用模板，界面友好，操作方便，运行流畅]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40681469</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40681469</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 16:14:23 +0800</pubDate><description><![CDATA[//.h文件
#ifndef STACK_H
#define STACK_H
#include
#include
using namespace std;
template        //链式栈结点
struct L_Node
{
 T data;
 L_Node* next;
 L_Node();
 L_Node(const T&item,L_Node* next=N]]></description><category></category></item><item><title><![CDATA[C++实现二叉树，运用模板，界面友好，操作方便 运行流畅]]></title><link>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40680591</link><guid>https://blog.youkuaiyun.com/zpcdcsdn/article/details/40680591</guid><author>zpcdcsdn</author><pubDate>Sat, 01 Nov 2014 14:53:21 +0800</pubDate><description><![CDATA[//.h文件
#ifndef TREE_H
#define TREE_H
#include
#include
using namespace std;
template
struct Node            //树结点
{
 T data;
 Node *left, *right;
 Node(const T& item);
};
template
Node::]]></description><category></category></item></channel></rss>