小青柑

2019-10-21 写生活

他叫张召忠,是个卖茶叶的小老头,当上了微商,每天忽悠人买茶叶,我也上了当,生平第一次微商手里买了一小罐茶叶,唤作小青柑,一百多块钱,也就一二两的样子吧,拆开一看全是小橘子,原来柑是这个意思,泡上一壶,小酌一口,直呼上当,简直苦到怀疑矩阵, 时间就这么一天天地过去了,那么贵的茶叶也不舍得浪费了,更不好意思泡给来的客人喝,于是乎硬着头皮干,到今天也算喝了一大半了,突然发现,细品之下那茶尽然是甜的,就是那种橘子的甜,但是又很淡,急易为人忽略,那种甜,转念一想又像是苦的,而且也不似当初那般苦了,这真是一壶神奇的茶啊,完全不像绿茶的纯香,不像红茶的浓郁,他只是把一种淡淡的甜,藏得那么深,故意与喝茶的人...

阅读全文>>

评论(0) 浏览(25)

[C++]Introduction to C++

2019-9-30 写技术

#include <iostream> #include <iomanip> using namespace std; class Shap{ private: int fulfill; int color; double pi; /* Mutable data member can be exchanged in const object. */ mutable int count; /* Const data member will handicape the copying of object, * and the c...

阅读全文>>

标签: C++

评论(0) 浏览(45)

[Data structures]Hanoi

2019-9-16 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 char stack[MAX][255]; int top = -1; void printStack() { int i; for(i=top; i>=0; i--){ printf("%s\n", stack[i]); } printf("\n"); } void hanoi(int n, char x, char y, char z) ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(41)

[Data structures]EvaluateExpression

2019-9-12 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 typedef int ElemType; typedef struct _SqStack{ ElemType *base; ElemType *top; int stackSize; }SqStack; int InitStack(SqStack *S) { S->base = (ElemType *)malloc(MAX*sizeof(ElemType...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(60)

[Data structures]Maze

2019-8-30 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_STACK 1024 #define MAX 11 typedef struct _PosType{ int x,y; }PosType; typedef struct _SElemType{ int ord; PosType seat; int di; }SElemType; typedef struct _MazeType{ int matrix[MAX][...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(62)

[Data structures]Stack

2019-8-30 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 typedef struct _SqStack{ int *base; int *top; int stackSize; }SqStack; int InitStack(SqStack *S) { S->base = (int *)malloc(MAX*sizeof(int)); S->top = S->base; S->stackSi...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(58)

[Data structures]Create index lists (An example of string)

2019-8-30 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_KEY_NUM 255 #define MAX 255 typedef unsigned char SString[MAX+1]; typedef struct _WordList{ char *item[MAX_KEY_NUM]; int last; }WordList; typedef struct _LinkList{ int book_number; struct _...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(52)

[Data structures]String

2019-8-23 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 255 typedef unsigned char SString[MAX+1]; int next[MAX]; /* * 0 :j == 1 * k :T[1...k-1] == T[j-(k-1)...j-1] * 1 :Others * */ void get_next(SString T, int next[]) { int i,j; i = 1; nex...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(65)

[Data structures]General list

2019-8-22 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 /* General list */ typedef struct _GLNode{ int tag; //0-atom, 1-node union{ char atom; struct{ struct _GLNode *hp; struct _GLNode *tp; }ptr; }; }GList; int server(...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(61)

[Data structures]Orthogonal link

2019-8-19 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _OLNode{ int i,j; int e; struct _OLNode *right, *down; }OLNode; typedef struct _CrossList{ OLNode **rhead; OLNode **chead; int m,n,t; //m rows, n cols, t none zero }CrossList; int CreateMatr...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(62)

Powered by anycle 湘ICP备15001973号