08 2019 档案

单链表的反转-递归
摘要：#include <stdio.h> typedef struct { int data; struct Node* next; }Node; Node* CreateNewNode(int value) { Node *temp = (Node*)malloc(sizeof(Node)); tem 阅读全文
posted @ 2019-08-02 21:21 Lilideng 阅读(345) 评论(0) 推荐(0)
链表的反转-非递归
摘要：#include <stdio.h> typedef struct{ int data; struct Node* next; }Node; Node* CreateNode(int value) { Node* temp = (Node*)malloc(sizeof(Node)); temp->d 阅读全文
posted @ 2019-08-02 20:50 Lilideng 阅读(168) 评论(0) 推荐(0)
利用链表计算两个数字之和
摘要：#include <stdio.h>typedef struct { int data; struct Node* next;}Node; Node* CreateNode(int value) { Node* temp = (Node*)malloc(sizeof(Node)); temp->da 阅读全文
posted @ 2019-08-01 10:55 Lilideng 阅读(413) 评论(0) 推荐(0)