<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wp123456xt的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wp123456xt</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wp123456xt]]></copyright><item><title><![CDATA[关于二叉树的相关操作]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7669861</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7669861</guid><author>wp123456xt</author><pubDate>Sat, 16 Jun 2012 23:48:16 +0800</pubDate><description><![CDATA[//关于二叉树的相关操作
#include
#include
#include
#include
typedef struct _tree
{
 char data;
 struct _tree *lchild;
 struct _tree *rchild;
 int ltag;//用于二叉树的线索化;
 int rtag;//用于二叉树的线索化;
}*ptree,tree]]></description><category></category></item><item><title><![CDATA[linux下VIM插件介绍及安装]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7603915</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7603915</guid><author>wp123456xt</author><pubDate>Sat, 26 May 2012 07:58:41 +0800</pubDate><description><![CDATA[//cscope
http://blog.chinaunix.net/u1/46984/showart_514862.html
http://www.yjpub.com/index.php/1081
http://blog.china.alibaba.com/blog/zhiqing20091027/article/b0-i8840186.html
http://hi.baidu.com/]]></description><category></category></item><item><title><![CDATA[TLB刷新的深入理解]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7583870</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7583870</guid><author>wp123456xt</author><pubDate>Sat, 19 May 2012 23:02:22 +0800</pubDate><description><![CDATA[为何linux内核的leave_mm中最后有一个load_cr3，这样的话岂不是又加载了cr3，这样岂不是违背了懒惰模式懒惰刷新tlb的初衷吗？这是邮件列表中很多人问的一个问题，要回答这一个问题，还要从2.6.18内核谈起。在2.6.18以及以前的内核中，leave_mm中是没有laod_cr3的，可是后来就有了，到底为什么？这一个要从cpu硬件的预取谈起。
每个cpu为了效率，几乎都会提前好几]]></description><category></category></item><item><title><![CDATA[数据结构-模拟银行业务]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7420538</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7420538</guid><author>wp123456xt</author><pubDate>Sun, 01 Apr 2012 21:41:04 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#define WINDOWS 10  //定义窗口数
typedef struct _Event//事件结构体
{
 struct _Event *next;
 int OccurTime;//事件发生时刻
 int NType;//事件类型(0表示客户到来，其他表示客户离开)
}EventType,*E]]></description><category></category></item><item><title><![CDATA[kmp算法实现的字符串匹配]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7385444</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7385444</guid><author>wp123456xt</author><pubDate>Thu, 22 Mar 2012 23:50:19 +0800</pubDate><description><![CDATA[#include
#include
int next[50];
void get_next(char *T,int *next)//求模式串的next数组
{
 int i=1,j=0;
 next[1]=0;//由定义知
 while(i
 {
  if(j==0||T[i]==T[j])
  {
   ++i;
   ++j;
   next[i]=j;
  }]]></description><category></category></item><item><title><![CDATA[关于循环移位]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7362950</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7362950</guid><author>wp123456xt</author><pubDate>Fri, 16 Mar 2012 22:49:35 +0800</pubDate><description><![CDATA[怎样降低循环移位的复杂度？我是通过交换来达到目的，有更好的方法吗
#include
#include
int main()
{
 int i,count=0,k,tmp,m,n,t,flag=0;//tmp是辅助结点
 printf("请输入所移位数\n");
 scanf("%d",&k);
 i=k-1;
 t=i;
 printf("请输入你希望的数字位数\n");]]></description><category></category></item><item><title><![CDATA[数组指针问题（求指教）]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/7021496</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/7021496</guid><author>wp123456xt</author><pubDate>Mon, 28 Nov 2011 23:44:45 +0800</pubDate><description><![CDATA[#include
using namespace std;
int main()
{
 float(**q)[5];
 float a[1][5]={{1,2,3,4,5}};
 q=&new float [1][5];//编译可以通过
 //q=&a;//编译通不过
 //q=new float*;//此处我原本想先给q分配一个内存空间，用于存取二维数组a的地址
 //却找不到]]></description><category></category></item><item><title><![CDATA[华北计算所其中一道机试题,逆转字符串,但是单词顺序不变，字符串中只含有字母和空格]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6788114</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6788114</guid><author>wp123456xt</author><pubDate>Sun, 18 Sep 2011 21:59:32 +0800</pubDate><description><![CDATA[#include
using namespace std;
int main()
{
 char *a="this is a book";
 char *p=a,*q=a;
 int i=strlen(a);
 while(i)
 {
  if(p[i-1]==]]></description><category></category></item><item><title><![CDATA[方正面试的题-找出字符串最多的分解方法]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6788107</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6788107</guid><author>wp123456xt</author><pubDate>Sun, 18 Sep 2011 21:55:51 +0800</pubDate><description><![CDATA[有长度m(>3)的字符串M，另有n个3个字符长度的子字符串，可以是重叠的，（如123，231，），
分解字符串M,搜索与子字符串一样的字符串个数，并找出最多的分解方法。
 
#include
using namespace std;
char m[100][4];
char b[1000];
int c[997];
int strcpy1(char *s1,char *s)
{]]></description><category></category></item><item><title><![CDATA[骑士聚会问题]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6786299</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6786299</guid><author>wp123456xt</author><pubDate>Sun, 18 Sep 2011 00:31:20 +0800</pubDate><description><![CDATA[在8×8的棋盘上分布着n个骑士，他们想约在某一格的中聚会，骑士每天可以像国际象棋中的马那样移动一次，如下图所示，可以从中间向8个方向移动，请你计算n个骑士的最早聚会地点和要走多少天。要求尽早聚会，且n个人走的总步数最少，先到聚会地点的骑士可以不再移动等候其他骑士。
    从键]]></description><category></category></item><item><title><![CDATA[高精度减法]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6769637</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6769637</guid><author>wp123456xt</author><pubDate>Mon, 12 Sep 2011 20:32:53 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
void subtract(char *a,char *b)
{
 int i,j,top=-1,k;
 if(strlen(a)>=strlen(b))
 {]]></description><category></category></item><item><title><![CDATA[高精度加法]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6769633</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6769633</guid><author>wp123456xt</author><pubDate>Mon, 12 Sep 2011 20:31:05 +0800</pubDate><description><![CDATA[#include
using namespace std;
void add(char *a,char *b)
{
 int i,j,k=0,carry;
 string s;
 char *c=(char *)malloc(sizeof(char)*(strlen(]]></description><category></category></item><item><title><![CDATA[高精度乘法]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6769597</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6769597</guid><author>wp123456xt</author><pubDate>Mon, 12 Sep 2011 20:06:00 +0800</pubDate><description><![CDATA[#include
using namespace std;
#define MAX 10000
char m[MAX];
char tmp[MAX];
void multip(char *a,char *b)
{
 int j,k,i,d,h=0,e;
 for(]]></description><category></category></item><item><title><![CDATA[poj1753 flip game题解]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6752875</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6752875</guid><author>wp123456xt</author><pubDate>Tue, 06 Sep 2011 11:45:58 +0800</pubDate><description><![CDATA[#include
using namespace std;
#include
#define MAX 65536
const int a[16]={                        
       0xc800,0xe400,0x7200,0x3100,]]></description><category></category></item><item><title><![CDATA[给出一个实数集合和一个实数，怎样判断集合中是否存在两个和等于该实数的元素]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6703410</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6703410</guid><author>wp123456xt</author><pubDate>Fri, 19 Aug 2011 23:40:29 +0800</pubDate><description><![CDATA[#include
#define N 8
using namespace std;
int main()
{
 float a[N];
 int i,j,mid,left,right,temp,temp1;
 for(i=0;i
  cin>>a[i];
 fo]]></description><category></category></item><item><title><![CDATA[十字链表的创建及输出操作]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6699422</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6699422</guid><author>wp123456xt</author><pubDate>Thu, 18 Aug 2011 19:16:37 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
#define M 4   //行数
#define N 4   //列数
typedef struct mtxn
{
 int row;
 int col;
 struct mtxn]]></description><category></category></item><item><title><![CDATA[int A[nSize]，其中隐藏着若干0，其余非0整数，写一个函数int Func(int* A, int nSize)，使A把0移至后面，非0整数移至]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6696072</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6696072</guid><author>wp123456xt</author><pubDate>Wed, 17 Aug 2011 19:58:58 +0800</pubDate><description><![CDATA[int A[nSize]，其中隐藏着若干0，其余非0整数，写一个函数int Func(int* A, int nSize)，使A把0移至后面，非0整数移至    
数组前面并保持有序(按原来顺序)，返回值为原数据中第一个元素为0的下标。(尽可能不使用辅助空间且考虑效率及异常问题]]></description><category></category></item><item><title><![CDATA[判断字符串是否可以通过交换相邻字符得到回文字符串，如果可以输出最少交换次数]]></title><link>https://blog.youkuaiyun.com/wp123456xt/article/details/6683872</link><guid>https://blog.youkuaiyun.com/wp123456xt/article/details/6683872</guid><author>wp123456xt</author><pubDate>Sat, 13 Aug 2011 11:33:48 +0800</pubDate><description><![CDATA[#include
using namespace std;
int count=1;//全局变量，计数；
int count1=0;//判断奇数个字母出现的次数
int Judge(char str[]);
int Circle(char str[]);
int Ci]]></description><category></category></item></channel></rss>