上图是题目需要实现的效果。
纯小白才开始学C语言,求指导,只输出了0到9,不知如何逆序输出。
中间重复的代码部分应该是要优化一下的,但暂时还不知到该怎么写。
#import <Foundation/Foundation.h>
typedef struct Node_ {
int value;
struct Node_ * next;
} Node;
Node *createNode(int value, Node *next) {
Node* node = malloc(sizeof(Node));
node->value = value;
node->next = next;
return node;
}
void printList(Node *firstNode) {
for (Node *node=firstNode; node!=NULL; node=node->next) {
printf("%d\n", node->value);
}
}
int main(int argc, const char * argv[]) {
@autoreleasepool {
Node *current = createNode(0, NULL);
Node *first = current;
current->next = createNode(1, NULL);
current = current->next;
current->next = createNode(2, NULL);
current = current->next;
current->next = createNode(3, NULL);
current = current->next;
current->next = createNode(4, NULL);
current = current->next;
current->next = createNode(5, NULL);
current = current->next;
current->next = createNode(6, NULL);
current = current->next;
current->next = createNode(7, NULL);
current = current->next;
current->next = createNode(8, NULL);
current = current->next;
current->next = createNode(9, NULL);
current = current->next;
printList(first);
char *str = "reversed:";
printf("%s\n", str);
}
return 0;
}
用递归就好了
来源:http://stackoverflow.com/questions/27047351/print-singly-linked-list-in-reverse-order