852

A

3,0

6 8

result = 3

min is 5

10,20

4 1

r=15

3!=6

12

30

ch=f

10

14

 void reverse(List* head){    List *p, *q;   p = head->next;  q = p -> next;  p -> next = NULL; while(q...

void merge(List *l1,List *l2) {    List *p, *q;   p = l1;  q = l2; while(p -> next != l1) {    p = p -> ...

void EnQueue(Link *rear, ElemType e) {  Link *p = (Link*)malloc(sizeof(Link));  if(!p) return ERROR;  p -> data = e;  p ->...

Queue QueueReverse(Queue q,Sqstack s) {  makeEmpty(s);  while(!isEmpty(q)) {   push(s,deQueue(q)); }    while(!isEmpty(s))...

串比较算法 比较串s1和s2的值，若s1 > s2, 返回值大于0， 若s1 <　s2 , 返回值小于0，若值相等，则返回串的长度差