CodeChallenges/Node.java at master · Tapszvidzwa/CodeChallenges · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
// package whatever; // don't place package name!

import java.io.*;


class Node {
    int data;
     Node next;
     Node prev;


static Node Reverse(Node head) {
  Node list=head;
  Node runner=list;
  Node prevNode=null;
  Node nextNode=null;

  if(runner.next!=null){
  nextNode=runner.next;
  }

  head.next=list.prev;
  System.out.println("head.next changed");
  head.prev=list.next;
  System.out.println("head.prev changed");
  runner=nextNode;


  return list;
}


public static void main(String [] args){
   Node major=new Node();
   Node major1=new Node();
   Node major2=new Node();
   Node major3=new Node();
   Node major4=new Node();
   Node major5=new Node();
   Node major6=new Node();
   Node major7=new Node();
   Node major8=new Node();
   Node major9=new Node();
   Node major10=new Node();

  major.data=1;
  major1.data=2;
  major2.data=3;
  major3.data=4;
  major4.data=5;
  major5.data=6;
  major6.data=7;
  major7.data=8;

  major.next=major1;
  major1.next=major2;
  major2.next=major3;
  major3.next=major4;
  major4.next=major5;
  major5.next=major6;
  major6.next=major7;

  major1.prev = major;
  major2.prev = major1;
  major3.prev = major2;
  major4.prev = major3;
  major5.prev = major4;
  major6.prev = major5;
  major7.prev = major6;


  Node runner=Reverse(major);


  while(runner!=null){
    System.out.println(runner.data);
    if(runner.next != null){
    System.out.println("next = "+ runner.next.data);
    }
    if (runner.prev != null){
    System.out.println("prev = "+ runner.prev.data);
    }
    runner=runner.prev;
  }


}
}