CreateNode and Display

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. using namespace std;
  4. typedef struct Node *list_pointer;
  5. struct Node {
  6. int data;
  7. list_pointer next;     
  8. }LNode;
  9. typedef struct Node *List;
  10. List first;
  11. void createNode(int len, int *array)
  12. {
  13. List newnode;
  14. for ( int i=0 ; i<len ; i++ )
  15.     {
  16.     newnode = (List)malloc(sizeof(LNode)); 
  17.     newnode->data = array[i];
  18.     newnode->next = first; 
  19.     first = newnode;
  20.     }
  21. }  
  22. list_pointer invert(List lead)
  23. {
  24. list_pointer middle,trail;
  25. middle = NULL;
  26. while ( lead )
  27.     {
  28.     trail = middle;
  29.     middle = lead;
  30.     lead = lead->next; 
  31.     middle->next = trail;  
  32.     }  
  33. return middle;
  34. }
  35. int main()
  36. {
  37. int array[4] ={ 0, 1, 2, 3};
  38. createNode(4,array);
  39. List current;
  40. current = first;
  41.  
  42. while ( current!=NULL )
  43.     {
  44.     printf("[%d]",current->data);
  45.     current = current->next;   
  46.     }
  47.     printf("\n");  
  48. }
ORIGIN
AFTER
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. using namespace std;
  4. typedef struct Node *list_pointer;
  5. struct Node {
  6. int data;
  7. list_pointer next;     
  8. }LNode;
  9. typedef struct Node *List;
  10. List first;
  11. void createNode(int len, int *array)
  12. {
  13. List newnode;
  14. for ( int i=0 ; i<len ; i++ )
  15.     {
  16.     newnode = (List)malloc(sizeof(LNode)); 
  17.     newnode->data = array[i];
  18.     newnode->next = first; 
  19.     first = newnode;
  20.     }
  21. }  
  22. list_pointer invert(List lead)
  23. {
  24. list_pointer middle,trail;
  25. middle = NULL;
  26. while ( lead )
  27.     {
  28.     trail = middle;
  29.     middle = lead;
  30.     lead = lead->next; 
  31.     middle->next = trail;  
  32.     }  
  33. return middle;
  34. }
  35. int main()
  36. {
  37. int array[4] ={ 0, 1, 2, 3};
  38. createNode(4,array);
  39. List current;
  40. current = invert(first);
  41.  
  42. while ( current!=NULL )
  43.     {
  44.     printf("[%d]",current->data);
  45.     current = current->next;   
  46.     }
  47.     printf("\n");  
  48. }




留言

張貼留言

這個網誌中的熱門文章

Codeforces --- string task

Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: deletes all the vowels, inserts a character " . " before each consonant, replaces all uppercase consonants with corresponding lowercase ones. Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program's input is exactly one string, it should return the output as a single string, resulting after the program's processing the initial string. Help Petya cope with this easy task. Input The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from  1  to  100 , inclusive. Output Print the resulting string. It is guaranteed that this string is...
閱讀完整內容

JAVA easy class -- circle

圖片
public   class  Circle2  {      public   static   void  main ( String [ ]  args )   {         Circle2 circle1  =   new  Circle2 ( ) ;          System . out . println ( "radius "   +  circle1. radius   +   " Area "   +  circle1. getArea ( ) ) ;         Circle2 circle2  =   new  Circle2 ( 30.0 ) ;          System . out . println ( "radius "   +  circle2. radius   +   " Area "   +  circle2. getArea ( ) ) ;         circle2. radius   =   40.0 ;          System . out . println ( "radius "   +  circle2. radius   +   " Area "   +  circle2. getArea ( ) ) ;      }      double  radius ;     Circle2 ( ) ...
閱讀完整內容

Uva 913

梯形公式 (a+b)*h / 2 amount                 number               1                           1 3                           3  5  7              (1+3)*2 -1                       5                           9 11 13 15 17  (1+3+5)*2-1 ... #include <iostream> using   namespace  std ; int  main ( ) { long   long   int  iSum, iNum ; long   long   int  iAmount, iHight ;           // (a+b)h/2 int  iLength, iCarry , iTemp ;     while   (   cin   >>  iAmount  )    ...
閱讀完整內容