Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
顺序表的实现——静态分配
//g++ 7.4.0 // 顺序表 静态分配 #include<stdio.h> typedef int ElemType; #define MaxSize 10 typedef struct { ElemType data[MaxSize]; int length; }SqList; void InitList(SqList &L) { //for(int i=0; i<MaxSize; i++) // L.data[i]=0; L.length=0; } int main() { SqList L; InitList(L); for(int i=0; i<MaxSize; i++) printf("data[%d]=%d\n", i, L.data[i]); return 0; }
run
|
edit
|
history
|
help
0
scemo dd
2720
2
多态
ConversionOperator
Adress
mergeSort
Counting top students
Addition of two matrix **Part 1
pure virtual function with non-fixed number of parameters