<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u012779816的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u012779816</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012779816]]></copyright><item><title><![CDATA[公司库存管理系统]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/17425801</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/17425801</guid><author>u012779816</author><pubDate>Thu, 19 Dec 2013 20:55:08 +0800</pubDate><description><![CDATA[#include
#include
#include
class appliance                          //家电类
{
public:
    void init();                         //初始化
void print();                        //显示
void search(char *)]]></description><category></category></item><item><title><![CDATA[类模板实现多数据类型线性链表]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/17322675</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/17322675</guid><author>u012779816</author><pubDate>Sat, 14 Dec 2013 19:23:45 +0800</pubDate><description><![CDATA[#include
#include
template 
class linklist
{
public:
linklist(int);  //构造
~linklist();//析构
void create();//创建
void print();//显示
void del();//删除
void insert();//插入
void search();//检索
void ]]></description><category></category></item><item><title><![CDATA[大整数的加减乘除求余]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/17043791</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/17043791</guid><author>u012779816</author><pubDate>Sat, 30 Nov 2013 18:55:43 +0800</pubDate><description><![CDATA[#include
#include                                
#define N 50                                     //N是计算的位数


class Integer                                    //大整数类  
{
public:
Integer();   ]]></description><category></category></item><item><title><![CDATA[huffman编码]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/16371017</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/16371017</guid><author>u012779816</author><pubDate>Sun, 17 Nov 2013 17:45:39 +0800</pubDate><description><![CDATA[#include
#include
#include
#define N 10
typedef struct s
{
char ch,parent;
int weight;
    struct s *lchild,*rchild;
}htnode;
int n;
htnode *creat(htnode *h)                      //创建
{
i]]></description><category></category></item><item><title><![CDATA[深拷贝]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/16358003</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/16358003</guid><author>u012779816</author><pubDate>Sat, 16 Nov 2013 16:09:08 +0800</pubDate><description><![CDATA[#include 
typedef struct s
{
char  ch;
s *next;
}ss;
typedef struct 
{
ss *front;
ss *rear;
}queue;
class Queue
{
public:
Queue();               //构造    
Queue(Queue &Q);       //拷贝构造
]]></description><category></category></item><item><title><![CDATA[一元多项式相加]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15341631</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15341631</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 18:16:56 +0800</pubDate><description><![CDATA[#include
#include
typedef struct s
{
int coef;
int index;
struct s *next;
}ss;
ss*creat()                                            //创建带头结点的链表
{
ss*head,*p,*s;
int m;
if((head=(ss*)mallo]]></description><category></category></item><item><title><![CDATA[命令行实现公式计算]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15341541</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15341541</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 18:05:15 +0800</pubDate><description><![CDATA[#include


int main(int n,char*p[])
{
int i,c,j,k=0,t,s=0,num[10];
char ch[9];  //存放运算符

//
for(i=0,j=0;p[1][i]!='\0';i++)
{  
t=j; // j 表示读到的运算符个数


if(p[1][i]=='+'||p[1][i]=='-'||p[1][]]></description><category></category></item><item><title><![CDATA[C语言递归实现二叉链表]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15341459</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15341459</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 17:55:51 +0800</pubDate><description><![CDATA[#include
#include


typedef struct BiNode
{
char data;
struct BiNode *lchild , *rchild; 
}BiTree;                                      //节点(数据，左孩子，右孩子 )
BiTree *create(BiTree *T)             ]]></description><category></category></item><item><title><![CDATA[停车场管理（栈和队列）]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15341405</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15341405</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 17:51:19 +0800</pubDate><description><![CDATA[#include
#include
#include
#define N 5
typedef struct s                        //队节点
{
char c[8];
struct s *next;
}ss;
typedef struct                          //指针节点
{
ss *front;
ss *rear;]]></description><category></category></item><item><title><![CDATA[约瑟夫问题（循环链表）]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15341359</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15341359</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 17:48:38 +0800</pubDate><description><![CDATA[#include
#include
typedef struct s
{
int a;
struct s *next;
}ss;                       //建立节点
ss*creat(int n)            //建立循环链表的函数
{
int i = 1;
ss*head,*p,*s;
head = (ss*)malloc(sizeof(ss]]></description><category></category></item><item><title><![CDATA[用栈实现任意进制转换]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15341233</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15341233</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 17:41:56 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#define N 30


typedef struct s
{
int data;
struct s*next;
}ss; 
                                              //节点
ss*push(ss*h,char m[],int b1,int b2]]></description><category></category></item><item><title><![CDATA[二叉链表（C++引用实现）]]></title><link>https://blog.youkuaiyun.com/u012779816/article/details/15340753</link><guid>https://blog.youkuaiyun.com/u012779816/article/details/15340753</guid><author>u012779816</author><pubDate>Mon, 11 Nov 2013 17:22:05 +0800</pubDate><description><![CDATA[#include
#include
#include
typedef struct BiNode
{
char data;
struct BiNode *lchild , *rchild; 
}BiTree;                                   //节点(数据，左孩子，右孩子 )
void create(BiTree * &T)           ]]></description><category></category></item></channel></rss>