Advertisement
Guest User

Untitled

a guest
Jul 27th, 2017
47
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.36 KB | None | 0 0
  1. public class assign4main {
  2.  
  3. public static void main(String[] args){
  4. data front = fillArray(); //fills array with 0-9 and returns front
  5. data current = null;
  6. printArray(front);
  7. System.out.println(findTail(front).iNum + " Is the tail");
  8. addTail(front, 11);
  9. System.out.println(findTail(front).iNum + " Is the tail");
  10.  
  11.  
  12. front = addFront(front, 14);
  13. printArray(front);
  14. }
  15.  
  16.  
  17.  
  18. static data addFront(data front, int n){
  19. data newFront = makeNewNode(n);
  20. newFront.next = front;
  21. return newFront;
  22.  
  23. }
  24.  
  25. static void addTail(data front, int n){
  26.  
  27. findTail(front).next = makeNewNode(n);
  28. }
  29.  
  30.  
  31. static data findTail(data front){
  32. data tail = front;
  33. while(tail.next !=null){
  34. tail = tail.next;
  35. }
  36.  
  37.  
  38. return tail;
  39.  
  40. }
  41.  
  42. static void printArray(data front){
  43. data current;
  44.  
  45. current = front;
  46. while(current != null){
  47. System.out.println(current.iNum);
  48. current = current.next;
  49. }
  50. }
  51.  
  52. static data fillArray(){
  53. data current = null;
  54. data front= null;
  55. for(int i = 0 ; i < 10; i++){
  56. if (i == 0){
  57. front = makeNewNode(i);
  58. current = front;
  59. } else {
  60.  
  61. current.next = makeNewNode(i);
  62. current = current.next;
  63. }
  64. }
  65. return front;
  66. }
  67.  
  68. static data makeNewNode(int n){
  69. data newNode;
  70. newNode = new data();
  71. newNode.iNum = n;
  72. return newNode;
  73. }
  74. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement