fork download
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. typedef struct node {
  5. int val;
  6. struct node *next;
  7. }Node;
  8.  
  9. Node *head = NULL;
  10.  
  11. Node* createN(int x){
  12. Node *newnode;
  13. newnode = (Node *)malloc(sizeof(Node));
  14. newnode->val = x;
  15. newnode->next = NULL;
  16. return newnode;
  17. }
  18.  
  19. void initL(int n){
  20. int x,i;
  21. Node *p;
  22. scanf("%d",&x);
  23. head = createN(x);
  24. p = head;
  25. for(i=1;i<n;i++){
  26. scanf("%d",&x);
  27. p->next = createN(x);
  28. p = p->next;
  29. }
  30. }
  31.  
  32. void freeL(){
  33. Node *p;
  34. while(head!=NULL){
  35. p = head->next;
  36. free(head);
  37. head = p;
  38. }
  39. }
  40.  
  41. void printL(){
  42. Node *p = head;
  43. while(p != NULL){
  44. printf("%d ",p->val);
  45. p = p->next;
  46. }
  47. printf("\n");
  48. }
  49.  
  50.  
  51. void insMiddle(int n, int x){
  52. int i;
  53. Node *p,*q;
  54. p=head;
  55. for(i=1;i<n;i++){
  56. p=p->next;
  57. }
  58. q=createN(x);
  59. q->next=p->next;
  60. p->next=q;
  61. }
  62.  
  63. void delMiddle(int n){
  64. int i;
  65. Node *p,*q;
  66. p=head;
  67. for(i=1;i<n-1;i++){
  68. p=p->next;
  69. }
  70. q=p->next;
  71. p->next=q->next;
  72. free(q);
  73. }
  74.  
  75. int main(void){
  76. int i,n,x,y,z;
  77. scanf("%d",&n);
  78. initL(n);
  79. printL();
  80. scanf("%d",&x,&y);
  81. insMiddle(x,y);
  82. printL();
  83. scanf("%d",&z);
  84. delMiddle(z);
  85. printL();
  86. freeL();
  87. return 0;
  88. }
Success #stdin #stdout 0s 5284KB
stdin
2
2
4
1
3
2
stdout
2 4 
2 1164910320 4 
2 1164910320