11734 - 231001_12/14_practice13-1
|
Time |
Memory |
| Case 1 |
1 sec |
32 MB |
| Case 2 |
1 sec |
32 MB |
| Case 3 |
1 sec |
32 MB |
| Case 4 |
1 sec |
32 MB |
Description
Finish the following 4 functions to finish the problem
(1.) void createNodeList(int n) //function to create the list
Get the data and put it to each node. (Get and Put data until the last node)
(2.) void reverseDispList() //function to convert the list in reverse
1. convert the first node as last
2. convert the last node as head
(3.) void displayList() //function to display the list
(4.) int NodeCount() //function to count the nodes
Note!! You must follow the instruction to create the same function name
Input
- The data for each node (An integer)
- The number of nodes (An integer)
Output
See the sample I/O
Tags