fork download
copy 
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. struct listNode {
  4.     int data;
  5.     struct listNode *nextPtr;
  6. };
  7.  
  8. int main(){
  9. listNode *startptr,*currentptr,*newptr,*nextptr,*prinptr;
  10. /*-------------加入10---------------*/
  11. newptr=new listNode;//要求空間
  12. newptr->nextPtr=NULL;
  13. newptr->data=10;
  14. currentptr=startptr=newptr;
  15. prinptr=startptr;//輸出整個串列
  16. printf("串列: ");
  17. while(prinptr!=NULL){
  18. 	printf("%d ",prinptr->data);
  19. 	prinptr=prinptr->nextPtr;
  20. }
  21. printf("\n");
  22. /*-------------加入10---------------*/
  23.  
  24. /*-------------加入11---------------*/
  25. newptr=new listNode;
  26. newptr->nextPtr=NULL;
  27. newptr->data=11;
  28. currentptr->nextPtr=newptr;
  29. currentptr=currentptr->nextPtr;
  30. prinptr=startptr;
  31. printf("串列: ");
  32. while(prinptr!=NULL){
  33. 	printf("%d ",prinptr->data);
  34. 		prinptr=prinptr->nextPtr;
  35. }
  36. printf("\n");
  37. /*-------------加入11---------------*/
  38.  
  39. /*-------------加入13---------------*/
  40. newptr=new listNode;
  41. newptr->nextPtr=NULL;
  42. newptr->data=13;
  43. currentptr->nextPtr=newptr;
  44. currentptr=currentptr->nextPtr;
  45. prinptr=startptr;
  46. printf("串列: ");
  47. while(prinptr!=NULL){
  48. 	printf("%d ",prinptr->data);
  49. 		prinptr=prinptr->nextPtr;
  50. }
  51. printf("\n");
  52. /*-------------加入13---------------*/
  53.  
  54. /*-------------加入12---------------*/
  55. newptr=new listNode;
  56. newptr->nextPtr=NULL;
  57. newptr->data=12;
  58. currentptr=startptr->nextPtr;
  59. newptr->nextPtr=currentptr->nextPtr;
  60. currentptr->nextPtr=newptr;
  61. currentptr=currentptr->nextPtr;
  62. prinptr=startptr;
  63. printf("串列: ");
  64. while(prinptr!=NULL){
  65. 	printf("%d ",prinptr->data);
  66. 		prinptr=prinptr->nextPtr;
  67. }
  68. printf("\n");
  69. /*-------------加入12---------------*/
  70.  
  71.  
  72. /*-------------刪除10---------------*/
  73. currentptr=startptr->nextPtr;
  74. delete(startptr);
  75. startptr=currentptr;
  76. prinptr=startptr;
  77. printf("串列: ");
  78. while(prinptr!=NULL){
  79. 	printf("%d ",prinptr->data);
  80. 		prinptr=prinptr->nextPtr;
  81. }
  82. printf("\n");
  83. /*-------------刪除10---------------*/
  84.  
  85. /*-------------刪除12---------------*/
  86. currentptr=startptr->nextPtr;
  87. startptr->nextPtr=startptr->nextPtr->nextPtr;
  88. delete(currentptr);
  89. prinptr=startptr;
  90. printf("串列: ");
  91. while(prinptr!=NULL){
  92. 	printf("%d ",prinptr->data);
  93. 		prinptr=prinptr->nextPtr;
  94. }
  95. printf("\n");
  96.  /*-------------刪除12---------------*/
  97.  
  98.  
  99. return 0;
  100. }
Success #stdin #stdout 0s 3460KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
串列: 10 
串列: 10 11 
串列: 10 11 13 
串列: 10 11 12 13 
串列: 11 12 13 
串列: 11 13
https://ideone.com/3upCpN
串列示範
language:
C++ (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!