vonfigo的专栏

//静态顺序表#define OK 1    #define ERROR 0   #define M 5   #include typedef struct {  int elem[M];  int length;}sqlist;int initlist_sq(sqlist *L){  L->length=0;  return OK;}int listinsert(sqlist *L,int i,

//单链表#define NULL 0     #define OK   1     #define ERROR 0       #include         #include typedef struct Lnode{  int data;      struct Lnode *next;}Lnode;void InitList_Lk(Lnode *L, int n){  Lnode *p;

import java.io.*;import java.util.*;import java.lang.*;class word //word object{ char[] invmap={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9}