https://blog.youkuaiyun.com/likee003zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/likee003/article/details/5972633https://blog.youkuaiyun.com/likee003/article/details/5972633likee003Thu, 28 Oct 2010 19:55:00 +0800#include #include #include #include #include #include #include #include #include using namespace std; int num[26]={0}; int index[26]={0}; int mai]]>https://blog.youkuaiyun.com/likee003/article/details/5959971https://blog.youkuaiyun.com/likee003/article/details/5959971likee003Fri, 22 Oct 2010 23:32:00 +0800#include #include #include #include #include #include #include #include #include using namespace std; int strlen(char* a) { if(0 == *a) retur]]>https://blog.youkuaiyun.com/likee003/article/details/5959963https://blog.youkuaiyun.com/likee003/article/details/5959963likee003Fri, 22 Oct 2010 23:26:00 +0800#include #include #include #include #include #include #include #include #include using namespace std; template https://blog.youkuaiyun.com/likee003/article/details/5959846https://blog.youkuaiyun.com/likee003/article/details/5959846likee003Fri, 22 Oct 2010 21:51:00 +0800#include #include #include #include #include #include using namespace std; #define MAXITEM 100 typedef struct { int key; int data; }LineList; void Sift(LineLi]]>https://blog.youkuaiyun.com/likee003/article/details/5959492https://blog.youkuaiyun.com/likee003/article/details/5959492likee003Fri, 22 Oct 2010 17:25:00 +0800#include #include #include #include #include #include using namespace std; int main() { int i; char string[80]; gets(string); for(i=0;i<80;i++) { if ((string[i]>='A')&&(s]]>https://blog.youkuaiyun.com/likee003/article/details/5917941https://blog.youkuaiyun.com/likee003/article/details/5917941likee003Fri, 01 Oct 2010 17:24:00 +0800#include #include #include #include #include #include using namespace std; const int MaxSize = 100; typedef struct tnode { char data; struct tnode *lchild, *rchild; }BTNode; ]]>https://blog.youkuaiyun.com/likee003/article/details/5719922https://blog.youkuaiyun.com/likee003/article/details/5719922likee003Thu, 08 Jul 2010 00:40:00 +0800#include "stdio.h" #include "conio.h" #include "string.h" void getnext(int next[],char s[],int l) /*求出NEXT */ { int i=1,j=0; next[1]=0; while(ihttps://blog.youkuaiyun.com/likee003/article/details/5714709https://blog.youkuaiyun.com/likee003/article/details/5714709likee003Mon, 05 Jul 2010 22:14:00 +0800#include #include using namespace std; int main(void) { int num = -12345, j = 0, i = 0, flag = 0, begin, end;//所有字符串翻转 char str[] = "i come from tianjin.", temp; j = strlen(str) - 1; printf("string = %s/n", str); ]]>https://blog.youkuaiyun.com/likee003/article/details/5714358https://blog.youkuaiyun.com/likee003/article/details/5714358likee003Mon, 05 Jul 2010 18:50:00 +0800方法一：整数转化为字符串，可以采用加'0'，再逆序的办法，整数加'0'就会隐性转化成char类型的数；
方法二：atoi函数。
代码如下：
#include #include using namespace std; int main(void) { int num = 12345, j = 0, i = 0; // char temp[7], str[7]; char str[7]; itoa(]]>https://blog.youkuaiyun.com/likee003/article/details/5711803https://blog.youkuaiyun.com/likee003/article/details/5711803likee003Sun, 04 Jul 2010 11:36:00 +0800#include using namespace std; #define Cutoff 3 void Swap(int &a, int &b) { int Tmp; Tmp = a; a = b; b = Tmp; } void InsertionSort(int A[], int N) { int j, P; int Tmp; for(P = 1; P < N; P++) { Tmp = A[P]; ]]>https://blog.youkuaiyun.com/likee003/article/details/5648924https://blog.youkuaiyun.com/likee003/article/details/5648924likee003Sat, 05 Jun 2010 09:15:00 +0800#include #include using namespace std; typedef struct { int key; int data; }LineList; void InsertSort(LineList R[], int n) { int i, j; LineList tmp; for(i=1;ihttps://blog.youkuaiyun.com/likee003/article/details/5366843https://blog.youkuaiyun.com/likee003/article/details/5366843likee003Wed, 10 Mar 2010 23:25:00 +0800https://blog.youkuaiyun.com/likee003/article/details/5182598https://blog.youkuaiyun.com/likee003/article/details/5182598likee003Tue, 12 Jan 2010 18:54:00 +0800https://blog.youkuaiyun.com/likee003/article/details/5161705https://blog.youkuaiyun.com/likee003/article/details/5161705likee003Fri, 08 Jan 2010 22:14:00 +0800Element); PrintList(L->Next); }}     这个程序如果空间和时间完全允许的话，完全没有问题，但是，我们注意一下，这里面用了一个递归算法。很不幸，]]>https://blog.youkuaiyun.com/likee003/article/details/5123965https://blog.youkuaiyun.com/likee003/article/details/5123965likee003Sun, 03 Jan 2010 11:59:00 +0800https://blog.youkuaiyun.com/likee003/article/details/5108520https://blog.youkuaiyun.com/likee003/article/details/5108520likee003Wed, 30 Dec 2009 20:01:00 +0800https://blog.youkuaiyun.com/likee003/article/details/5090688https://blog.youkuaiyun.com/likee003/article/details/5090688likee003Mon, 28 Dec 2009 13:52:00 +0800https://blog.youkuaiyun.com/likee003/article/details/5090625https://blog.youkuaiyun.com/likee003/article/details/5090625likee003Mon, 28 Dec 2009 13:42:00 +0800https://blog.youkuaiyun.com/likee003/article/details/4981467https://blog.youkuaiyun.com/likee003/article/details/4981467likee003Thu, 10 Dec 2009 19:23:00 +0800https://blog.youkuaiyun.com/likee003/article/details/4978541https://blog.youkuaiyun.com/likee003/article/details/4978541likee003Thu, 10 Dec 2009 12:42:00 +0800