C语言 我的代码可以在一个编译器上工作，但不能在其他编译器上工作,

ezykj2lf  于 2023-10-16  发布在  其他
关注(0)|答案(1)|浏览(164)

linkedList.c：

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  5. struct Node {
  6.     int data;
  7.     struct Node *next;
  8. };
  10. typedef struct Node *node;
  12. node createNode(int val) {
  13.     node newNode = (node)malloc(sizeof(struct Node));
  14.     if (newNode == NULL) {
  15.         printf("cannot allocate memory");
  16.         exit(EXIT_FAILURE);
  17.     }
  18.     newNode->data = val;
  19.     newNode->next = NULL;
  20.     return newNode;
  21. }
  23. node insertFront(node head, int val) {
  24.     node insert = createNode(val);
  25.     if (head == NULL) {
  26.         head = insert;
  27.         return head;
  28.     }
  29.     insert->next = head;
  30.     head = insert;
  31.     return head;
  32. }
  34. node insertTail(node head, int val) {
  35.     node insert = createNode(val);
  36.     node temp = head;
  37.     if (head == NULL) {
  38.         head = insert;
  39.         return head;
  40.     }
  41.     while (temp->next != NULL)
  42.         temp = temp->next;
  43.     temp->next = insert;
  44.     insert->next = NULL;
  45.     return head;
  46. }
  48. node listSearch(node head, int val) {
  49.     node temp = head;
  50.     while (temp != NULL) {
  51.         if (temp->data == val) {
  52.             printf("%d\n", 1);
  53.             return temp;
  54.         }
  55.         temp = temp->next;
  56.     }
  57.     printf("%d\n", -1);
  58.     return NULL;
  59. }
  61. node insertAfter(node head, int afterThisVal, int val) {
  62.     node afterThis = listSearch(head, afterThisVal);
  63.     if (afterThis == NULL)
  64.         return head;
  65.     if (afterThis->next == NULL) {
  66.         head = insertTail(head, val);
  67.         return head;
  68.     }
  69.     node insert = createNode(val);
  70.     node temp = afterThis->next;
  71.     afterThis->next = insert;
  72.     insert->next = temp;
  73.     return head;
  74. }
  76. node insertBefore(node head, int beforeThisVal, int val) {
  77.     node beforeThis = listSearch(head, beforeThisVal);
  78.     if (beforeThis == NULL)
  79.         return head;
  80.     if (beforeThis == head) {
  81.         head = insertFront(head, val);
  82.         return head;
  83.     }
  84.     
  85.     node prev = head;
  86.     while (prev->next != beforeThis)
  87.         prev = prev->next;
  89.     node insert = createNode(val);
  90.     prev->next = insert;
  91.     insert->next = beforeThis;
  92.     return head;
  93. }
  95. node deleteFirst(node head) {
  96.     if (head == NULL) {
  97.         printf("%d\n", -1);
  98.         return head;
  99.     }
  100.     node temp = head;
  101.     head = head->next;
  102.     printf("%d\n", temp->data);
  103.     free(temp);
  104.     return head;
  105. }
  107. node deleteLast(node head) {
  108.     if (head == NULL) { 
  109.         printf("%d\n", -1);
  110.         return head;
  111.     }
  112.     node temp = head;
  113.     node prev = NULL;
  114.     while (temp->next != NULL) {
  115.         prev = temp;
  116.         temp = temp->next;
  117.     }
  118.     if (prev != NULL)
  119.         prev->next = NULL;
  120.     printf("%d\n", temp->data);
  121.     free(temp);
  122.     return head;
  123. }
  125. node deleteNode(node head, int val) {
  126.     node found = listSearch(head, val);
  127.     if (found == NULL) {
  128.         printf("%d\n",-1);
  129.         return head;
  130.     }
  131.     else if (found == head) {
  132.         head = deleteFirst(head);
  133.         return head;
  134.     }
  135.     else if (found->next == NULL) {
  136.         head = deleteLast(head);
  137.         return head;
  138.     }
  139.     node prev = head;
  140.     while (prev->next != found)
  141.         prev = prev->next;
  142.     prev->next = found->next;
  143.     printf("%d\n", found->data);
  144.     free(found);
  145.     return head;
  146. }
  148. void display(node head) {
  149.     if (head == NULL)
  150.         return;
  151.     node temp = head;
  152.     while (temp->next != NULL) {
  153.         printf("%d ", temp->data);
  154.         temp = temp->next;
  155.     }
  156.     printf("%d\n", temp->data);
  157. }
  159. node reverseList(node head) {
  160.     node i = head;
  161.     node j = NULL;
  162.     node k = NULL;
  164.     while (i != NULL) {
  165.         k = j;
  166.         j = i;
  167.         i = i->next;
  168.         j->next = k;
  169.     }
  170.     return j;
  171. }
  173. node reverseEven(node head) {
  174.     node oddHead = head;
  175.     node odd = head;
  176.     node evenHead = head->next;
  177.     node even = head->next;
  178.     node temp1 = NULL;
  179.     node temp2 = NULL;
  180.     while (odd->next != NULL && even->next != NULL) {
  181.         odd->next = even->next;
  182.         odd = odd->next;
  183.         even->next = odd->next;
  184.         even = even->next;
  185.     }
  186.     if ((odd != NULL && odd->next != NULL) || (even != NULL && even->next != NULL)) {
  187.         odd->next = NULL;
  188.         even->next = NULL;
  189.     }
  190.     display(evenHead);
  191.     display(oddHead);
  192.     evenHead = reverseList(evenHead);
  193.     even = evenHead;
  194.     odd = oddHead;
  195.     while (even != NULL && odd != NULL) {
  196.         temp1 = odd;
  197.         odd = odd->next;
  198.         temp1->next = even;
  199.         temp2 = even;
  200.         even = even->next;
  201.         temp2->next = odd;
  202.     }
  203.     return head;
  204. }
  206. int main() {
  207.     char op[2];
  208.     node head = NULL;
  209.     int inp1, inp2;
  210.     scanf("%s", op);
  211.     while (strcmp(op, "e") != 0) {
  212.         if (strcmp(op, "f") == 0) {
  213.             scanf("%d", &inp1);
  214.             head = insertFront(head, inp1);
  215.             display(head);
  216.         }
  217.         else if (strcmp(op, "t") == 0) {
  218.             scanf("%d", &inp1);
  219.             head = insertTail(head, inp1);
  220.             display(head);
  221.         }
  222.         else if (strcmp(op, "a") == 0) {
  223.             scanf("%d", &inp1);
  224.             scanf("%d", &inp2);
  225.             head = insertAfter(head, inp2, inp1);
  226.             display(head);
  227.         }
  228.         else if (strcmp(op, "b") == 0) {
  229.             scanf("%d", &inp1);
  230.             scanf("%d", &inp2);
  231.             head = insertBefore(head, inp2, inp1);
  232.             display(head);
  233.         }
  234.         else if (strcmp(op, "d") == 0) {
  235.             scanf("%d", &inp1);
  236.             head = deleteNode(head, inp1);
  237.             display(head);
  238.         }
  239.         else if (strcmp(op, "i") == 0) {
  240.             head = deleteFirst(head);
  241.             display(head);
  242.         }
  243.         else if (strcmp(op, "l") == 0 ){
  244.             head = deleteLast(head);
  245.             display(head);
  246.         }
  247.         else if (strcmp(op, "s") == 0) {
  248.             scanf("%d", &inp1);
  249.             listSearch(head, inp1);
  250.         }
  251.         else if (strcmp(op, "r") == 0) {
  252.             head = reverseList(head);
  253.         }
  254.         else if (strcmp(op, "ds") == 0) {
  255.             display(head);
  256.         }
  257.         else if (strcmp(op, "re") == 0) {
  258.             head = reverseEven(head);
  259.         }
  260.         else {
  261.             printf("INVALID\n");
  262.         }
  263.         scanf("%s", op);
  264.     }
  265.     return 1;
  266. }

我的代码实现了链表的所有功能作为一个菜单驱动的程序。

input.txt：

  1. f 7
  2. t 10
  3. a 11 7
  4. b 12 11
  5. d 10
  6. i
  7. l
  8. s 12
  9. s 6
  10. t 15
  11. f 14
  12. f 20
  13. ds
  14. r
  15. re
  16. e

我看到的错误是分段错误。在input.txt中f 20之后的ds（显示函数），head随机获得一个垃圾值，并显示mingw_ovr _bulletin_va_lists部分我不确定我犯了什么错误。
请原谅我在代码中使用的不好的做法，因为我还在学习C。

c

1条答案

按热度按时间
nhjlsmyf

nhjlsmyf1#

函数deleteLast中有一个bug：你必须测试head是否已经是最后一个节点，并在释放temp后返回NULL。当你在这之后从head读取时，你有未定义的行为，因为你解引用了一个无效的指针。未定义的行为意味着任何事情都可能发生，包括不同运行或不同计算机上的不同行为。
以下是修改后的版本：

  1. node deleteLast(node head) {
  2.     if (head == NULL) { 
  3.         printf("%d\n", -1);
  4.         return head;
  5.     }
  6.     node temp = head;
  7.     node prev = NULL;
  8.     while (temp->next != NULL) {
  9.         prev = temp;
  10.         temp = temp->next;
  11.     }
  12.     if (prev == NULL) {
  13.         head = NULL;
  14.     } else {
  15.         prev->next = NULL;
  16.     }
  17.     printf("%d\n", temp->data);
  18.     free(temp);
  19.     return head;
  20. }

在main中还有一个问题：将op定义为2个char的数组：这个数组只能存储一个字符串，最多一个字符和一个空字节，但是你用scanf("%s", op)从用户那里读取，所以任何超过1个字符的输入字都会导致缓冲区溢出，因为scanf()不知道目标数组有多长。
您应该使数组更长，并告诉scanf()要存储到目标数组中的最大字符数，其长度介于%和s之间：

  1. char op[20];
  2.     node head = NULL;
  3.     int inp1, inp2;
  4.     if (scanf("%19s", op) != 1)
  5.         return 1;
展开查看全部
赞(0）分享  回复(0）举报  2023-10-16
我来回答

相关问题

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新问答

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com