程序员面试题：How to reverse a list

最新推荐文章于 2022-02-14 21:48:12 发布

ani_di

最新推荐文章于 2022-02-14 21:48:12 发布

阅读量784

点赞数

分类专栏： C++/C 文章标签：面试 list struct function

本文链接：https://blog.csdn.net/ani_di/article/details/6539764

版权

C++/C 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Q: implement a function that give a list head as a arg, and return another list head which the list reversed.

// annidy@gmail.com #include <stdio.h> #include <stdlib.h> typedef struct _Node { struct _Node* next; int value; } Node; Node* reverse(Node* head) { Node* last = head->next; head->next = 0; while(last) { Node* tmp = last->next; last->next = head; head = last; last = tmp; } return head; } int main(int argc, char* argv[]) { Node d1 = {0, 1}; Node d2 = {0, 2}; Node d3 = {0, 3}; Node d4 = {0, 4}; d1.next = &d2; d2.next = &d3; d3.next = &d4; Node* p = reverse(&d1); while(p) { printf("%d", p->value); p = p->next; } return 0; }

PS: 对于我这个算法的实现，还算比较满意。最近在阅读stl源码里面，找到了类似的实现，大家做了比较

stl_slist.h

inline __slist_node_base* __slist_reverse(__slist_node_base* node)
{
  __slist_node_base* result = node;
  node = node->next;
  result->next = 0;
  while(node) {
    __slist_node_base* next = node->next;
    node->next = result;
    result = node;
    node = next;
  }
  return result;
}

基本差不多。