Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
不带头结点的单链表
//g++ 7.4.0 #include<stdio.h> typedef int ElemType; typedef struct LNode{ ElemType data; struct LNode *next; }LNode, *LinkList; bool InitList(LinkList &L) { L = NULL; return true; } bool Empty(LinkList L) { return L==NULL; } LNode * GetElem(LinkList L, int i) { int j = 1; LNode *p = L->next; if(i==0) return L; if(i<1) return NULL; while(p!=NULL && j<i) { p = p->next; j++; } return p; } void test() { LinkList L; InitList(L); } int main() { test(); return 0; }
run
|
edit
|
history
|
help
0
ADAKOHL - hpclearn
Expected types
11933
Treap (making range queries(that are not possible on seg_Trees) possible with no effort) : (863D)
PreDir2
gal2
point to a rvalue
template
3 and 7 in a row
Привет Linux