摘要:
1 阅读全文
摘要:
1.循环左移void reverse(char *start,char *end){ char temp = '\0'; while(start "Wuhan. from am I"void reverse(char *start,char *end){ char temp = '\0'; while(start <end) { temp = *start; *start = *end; *end = temp; start++; end--; }}void ReverseSentence(char *str){ char *start 阅读全文
摘要:
1.可以通过记录最后一个节点来判断是否相交while(pa->next){ pa = pa-next;} while(pb->next){ pb= pb->next;}if(pa == pb){...}2.只给定单链表中某个结点p(并非最后一个结点,即p->next!=NULL)指针,删除该结点,无头结点基本原理,讲当前结点的下个一个结点的数据赋值给当前结点,然后释放下一个结点。typedef struct node{ int value; struct node *next;} list_node;void test(list_node* pCur){ list_no 阅读全文