fork download
copy 
  1. // sennkei list
  2.  
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5.  
  6. typedef struct node {
  7.     int val;
  8.     struct node *next;
  9. }Node;
  10.  
  11. Node *head = NULL;
  12.  
  13. Node* createN(int x){
  14.     Node *newnode;
  15.     newnode = (Node *)malloc(sizeof(Node));
  16.     newnode->val = x;
  17.     newnode->next = NULL;
  18.     return newnode;
  19. }
  20.  
  21. void initL(int n){
  22.     int x,i;
  23.     Node *p;
  24.     scanf("%d",&x);
  25.     head = createN(x);
  26.     p = head;
  27.     for(i=1;i<n;i++){
  28.         scanf("%d",&x);
  29.         p->next = createN(x);
  30.         p = p->next;
  31.     }
  32. }
  33.  
  34. void freeL(){
  35.     Node *p;
  36.     while(head!=NULL){
  37.         p = head->next;
  38.         free(head);
  39.         head = p;
  40.     }
  41. }
  42.  
  43. void printN(Node *a){
  44.     if(a == NULL) printf("NULL\n");
  45.     else printf("%d\n",a->val);
  46. }
  47.  
  48. void printL(){
  49.     Node *p = head;
  50.     while(p != NULL){
  51.         printf("%d ",p->val);
  52.         p = p->next;
  53.     }
  54.     printf("\n");
  55. }
  56.  
  57. Node* getN(int n){
  58.     int i;
  59.     Node *p;
  60.     p = head;
  61.     for(i=1;i<n;i++) p = p->next;
  62.     return p;
  63. }
  64.  
  65. int countL(){
  66.     int ret = 0;
  67.     Node *p = head;
  68.     while(p!=NULL){
  69.         p = p->next;
  70.         ret++;
  71.     }
  72.     return ret;
  73. }
  74.  
  75. Node* searchX(int x){
  76.     Node *p;
  77.     for(p=head; p!=NULL; p=p->next){
  78.         if(p->val == x) break;
  79.     }
  80.     return p;
  81. }
  82.  
  83. void insHead(int x){
  84.     Node *p;        //１
  85.     p = createN(x); //１
  86.     p->next = head; //２
  87.     head = p;       //３
  88. }
  89.  
  90. void insMiddle(int n, int x){
  91.     int i;
  92.     Node *p,*q;
  93.     p = head;           //１
  94.     for(i=1;i<n;i++){   //２
  95.         p = p->next;    //２
  96.     }
  97.     q = createN(x);     //３
  98.     q->next = p->next;  //４
  99.     p->next = q;        //５
  100. }
  101.  
  102. void insTail(int x){
  103.     Node *p;
  104.     p = head;               //１
  105.     if(p==NULL){
  106.         head = createN(x);
  107.         return;
  108.     }
  109.     while(p->next != NULL){ //２
  110.         p = p->next;        //２
  111.     }
  112.     p->next = createN(x);   //３
  113. }
  114.  
  115. void delHead(){
  116.     Node *p;
  117.     p = head;           //１
  118.     head = head->next;  //２
  119.     free(p);            //３
  120. }
  121.  
  122. void delMiddle(int n){
  123.     int i;
  124.     Node *p,*q;
  125.     p = head;           //１
  126.     for(i=1;i<n-1;i++){ //２
  127.         p = p->next;    //２
  128.     }
  129.     q = p->next;        //３
  130.     p->next = q->next;  //４
  131.     free(q);            //５
  132. }
  133.  
  134. void delTail(){
  135.     Node *p;
  136.     p = head;                       //１
  137.     while(p->next->next != NULL){   //２
  138.         p = p->next;                //２
  139.     }
  140.     free(p->next);                  //３
  141.     p->next = NULL;                 //４
  142. }
  143.  
  144. void delX(int x){
  145. 	Node *p;
  146. 	p = head;
  147. 	for(int i=1;i<x-1;i++){
  148. 		p=p->next;
  149. 	}
  150. 	p->next=p->next->next;
  151. }
  152.  
  153. int main(void){
  154.     int i,n,x;
  155.     scanf("%d",&n);
  156.     initL(n);
  157.     scanf("%d",&x);
  158.     delX(x);
  159.     printL();
  160.     freeL();
  161.     return 0;
  162. }
Success #stdin #stdout 0s 5292KB
comments (?)
stdin
copy 
4
1 3 5 7
3
stdout
copy 
1 3 7
https://ideone.com/ioL0Hk
language:
C (gcc 8.3)
created:
11 days 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!