<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[KLNL100的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/KLNL100</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; KLNL100]]></copyright><item><title><![CDATA[函数传递的时候参数传递和栈帧结构]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21836013</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21836013</guid><author>KLNL100</author><pubDate>Sat, 22 Mar 2014 23:50:29 +0800</pubDate><description><![CDATA[调用函数的时候首先进行参数压栈，一般情况下压栈顺序为从右到左，最有压函数的地址；在windows平台下，栈都是从下到上生长的]]></description><category></category></item><item><title><![CDATA[队列的入列和出列]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21749411</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21749411</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 23:08:00 +0800</pubDate><description><![CDATA[#include
using namespace std;
typedef struct student
{
int data;
student *next;
}node;


typedef struct linkqueue
{
node* first,*rear;
}queue1;
//队列的入队
queue *insert(queue1 *HQ,int x)
{]]></description><category></category></item><item><title><![CDATA[关于数据结构的一个疑问]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21739481</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21739481</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 19:13:13 +0800</pubDate><description><![CDATA[为什么如果按index访问item并就地插入或删除数据 这种操作比较频繁 ，为什么使用数组最节省时间]]></description><category></category></item><item><title><![CDATA[用循环列表解决一个约瑟夫问题]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21739253</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21739253</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 19:07:50 +0800</pubDate><description><![CDATA[#include
using namespace std;
typedef struct LNode
{
int data;
LNode* link;
}LNode,*LinkList;
//n为总人数，k为第一个报数的人，m为出列者喊道的数
void JOSEPHUS(int n,int k,int m)
{
//p为当前节点，r为辅助节点，指向p的前驱结点，list为头结点]]></description><category></category></item><item><title><![CDATA[双链表的建立]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21733621</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21733621</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 17:30:46 +0800</pubDate><description><![CDATA[#include
using namespace std;
struct Node
{
int data;
Node * pre;
Node* Next;
}
Node *Creat()
{
Node * head;
head->pre = NULL;
head->data = NULL;
Node* p = head;
Node* q = head;
Node* s]]></description><category></category></item><item><title><![CDATA[遍历一次求单链表中间节点]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21731293</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21731293</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 17:07:32 +0800</pubDate><description><![CDATA[Node* FindMid(Node* head)
{
if(NULL == head||NULL = head->next)
return head;
Node *p = head->next;;
Node *q = p;
while(NULL != p)
{
p = p->next->next;
q = q->next;

}
return q;
}]]></description><category></category></item><item><title><![CDATA[删除单链表第一个元素]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21690545</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21690545</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 07:58:12 +0800</pubDate><description><![CDATA[Node* Dele(Node* head)
{
if(NULL == head)
return head;
Node* p = head;
Node* q = p->next;
if(NULL == q)
return head;
p->next = q->next;
free(q);
return head;
}]]></description><category></category></item><item><title><![CDATA[单链表逆置]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21690115</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21690115</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 07:36:08 +0800</pubDate><description><![CDATA[node* reverse(node *head)
{
if(NULL == head || NULL == head->next)//不要忘记了判断为空的情况
return head;
Node* q = head->next;
q->next = NULL;
Node *p = head->next->next;
Node *s = p->next;
while(NULL !=]]></description><category></category></item><item><title><![CDATA[单链表排序]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21663001</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21663001</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 00:44:38 +0800</pubDate><description><![CDATA[//假设由小到大进行排序
Node*  Sort(Node* head)
{
node *p p = head;
node *p q= p->next;
int m,n,temp;
int nlength = length(head);
    if(NULL == head || NULL == head)
{
return head;
}

while(NULL != ]]></description><category></category></item><item><title><![CDATA[单链表的插入]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21661559</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21661559</guid><author>KLNL100</author><pubDate>Fri, 21 Mar 2014 00:25:08 +0800</pubDate><description><![CDATA[//假设顺序为从小到大
Node * Insert(Node* head,int e)
{
Node* q = head;
Node* p = (Node*)malloc(sizeof(Node));
p->data = e;

while((edata) && NULL != q->next)
{
q=q->next;
}

if(NULL == q->next)
{]]></description><category></category></item><item><title><![CDATA[单链表编程删除]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21658585</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21658585</guid><author>KLNL100</author><pubDate>Thu, 20 Mar 2014 23:52:20 +0800</pubDate><description><![CDATA[Node* Dele(Node* head,int value)
{
if(NULL != head->next)
{
Node*  p = head;
Node* q = p;
while(value != p->data)
{
q=p;
p = p->next;
}
q->next = p->next;
}
       return head;
}]]></description><category></category></item><item><title><![CDATA[单链表的建立、测长和打印]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21654781</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21654781</guid><author>KLNL100</author><pubDate>Thu, 20 Mar 2014 23:41:30 +0800</pubDate><description><![CDATA[#include


using namespace std;


typedef struct St
{
int data;
Node * next;
}Node;


Node* Create()
{
Node* q= (Node*)malloc(sizeof(Node));
        int x;
        Bool circle = True;]]></description><category></category></item><item><title><![CDATA[斐波那契数列]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21592011</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21592011</guid><author>KLNL100</author><pubDate>Thu, 20 Mar 2014 11:40:08 +0800</pubDate><description><![CDATA[几个例子：
1、

三角形的三边关系定理和斐波那契数列的一个联系：


　有长为144cm的铁丝，要截成n小段（n>2），每段的长度不小于1cm，如果其中任意三小段都不能拼成三角形，则n的最大值为多少？

2、　现一对兔子每月能生一对小兔，而每对小兔在他出生后的第三个月，就能开始生小兔，如果兔子是长生不老的，由一对刚出生的小兔开始，一年之后会有多少对兔子？




斐波那]]></description><category></category></item><item><title><![CDATA[strcpy memcpy memset]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21549727</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21549727</guid><author>KLNL100</author><pubDate>Wed, 19 Mar 2014 20:42:32 +0800</pubDate><description><![CDATA[一、strcpy
函数原型：extern char* strcpy(char*dest,const char *src)
头文件：#include
功能：把从src地址开始含有' \o'结束符的字符串复制到以dest开始的地址空间
说明：src和dest 必须有足够空间来容纳src的字符串
返回：指向dest的指针
char *strcpy(char* strDestination,c]]></description><category></category></item><item><title><![CDATA[常见基本类型所占字节数]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21244751</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21244751</guid><author>KLNL100</author><pubDate>Fri, 14 Mar 2014 21:34:47 +0800</pubDate><description><![CDATA[16位编辑器：
char：1个字节
short ：2
int：2
unsigned int:2
long：2

long long:8
float:4
double:8


32位编辑器：
char：1
short：2
int：4
unsigned int：4
long:4
unsigned long:4
long long:8
float：4
doubl]]></description><category></category></item><item><title><![CDATA[sizeof]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21234255</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21234255</guid><author>KLNL100</author><pubDate>Fri, 14 Mar 2014 13:41:28 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
//数组是“传址调用”的，调用者只需将实参的地址传递过去
/*void foo3(char a3[3])
{
cout

}
void foo4(char a4[])
{
cout
}*/






int main()
{
//1、基本数据类型  省略
//2、指针变量]]></description><category></category></item><item><title><![CDATA[几种常见类型与零值进行比较]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21222577</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21222577</guid><author>KLNL100</author><pubDate>Fri, 14 Mar 2014 09:06:51 +0800</pubDate><description><![CDATA[1、bool
 flag = FALSE
if（flag）
if（！flag）
2、float   flag
m = 0.000001
if((flag >= -m)&&(flag 
3、指针 p 
if(p == NULL)
if(p !=  NULL )
4、int flag
if（flag == 0）
if（flag  != 0）]]></description><category></category></item><item><title><![CDATA[GetMemory()]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/21106613</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/21106613</guid><author>KLNL100</author><pubDate>Wed, 12 Mar 2014 18:35:44 +0800</pubDate><description><![CDATA[#include
using namespace std;
#include
using namespace std;
//1，调用GetMemory( str )后， str并未产生变化，依然是NULL.只是改变的str的一个拷贝的内存的变化   
//2，strcpy( str, "hello world" );程序运行到这将产生错误。
//3，new的时候有可能内存出错，应该在*]]></description><category></category></item><item><title><![CDATA[类模板]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/20990807</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/20990807</guid><author>KLNL100</author><pubDate>Tue, 11 Mar 2014 10:04:41 +0800</pubDate><description><![CDATA[类模板可以重载可以继承；
类模板可以继承普通类；
类模板的基类也可以是类模板；
类模板主要由于实现容器；]]></description><category></category></item><item><title><![CDATA[有关操作系统的基本知识]]></title><link>https://blog.youkuaiyun.com/KLNL100/article/details/20953003</link><guid>https://blog.youkuaiyun.com/KLNL100/article/details/20953003</guid><author>KLNL100</author><pubDate>Mon, 10 Mar 2014 21:51:27 +0800</pubDate><description><![CDATA[1、试解释操作系统原理中的作业、进程、管程的各自定义。
作业：用户在一次解题或者食物处理过程中要求计算机所做工作的集合。它包括用户程序所需的数据以及控制命令。作业是由一系列的步骤组成。
进程：一个程序在一个数据集合上的一次运行。所以一个程序在不同数据集合上的运行是不同的线程，一个程序在同一个数据集合上的多次运行都是不同的进程。
线程：是进程中的一个实体，是被系统独立调度和执行的基本单位。
]]></description><category></category></item></channel></rss>