Reverse a LinkedList

Problem statement: Reverse a LinkedList in java !

1. class Node5 {
2. Node5 next;
3. int data;
4. 
   
5. Node5(int data) {
6. this.data = data;
7. }
8. } // end of Node5
9. 
   
10. public class ReverseLinkedList {
11. 
    
12. Node5 head;
13. 
    
14. public static void main(String[] args) {
15. ReverseLinkedList l = new ReverseLinkedList();
16. l.add(3);
17. l.add(5);
18. l.add(8);
19. l.add(9);
20. l.print(l.head);
21. l.reverse();
22. System.out.println("\nafter reverse linked list");
23. l.print(l.head);
24. } // end of main()
25. 
    
26. // add the element in LinkedList
27. public void add(int data) {
28. Node5 next = new Node5(data);
29. if (head == null) {
30. head = next;
31. return;
32. }
33. Node5 last = head;
34. while (last.next != null) {
35. last = last.next;
36. }
37. last.next = next;
38. } // end of add()
39. 
    
40. // print the LinkedList
41. void print(Node5 next) {
42. Node5 temp = next;
43. while (temp != null) {
44. System.out.print(temp.data + "-->");
45. temp = temp.next;
46. }
47. } // end of print()
48. 
    
49. // reverse the LinkedList
50. Node5 reverse() {
51. Node5 prev = null;
52. Node5 current = head;
53. Node5 next = null;
54. while (current != null) {
55. next = current.next;
56. current.next = prev;
57. prev = current;
58. current = next;
59. }
60. head = prev;
61. return head;
62. } // end of reverse()
63. } //end of ReverseLinkedList 

Output: 

3-->5-->8-->9-->

after reverse linked list

9-->8-->5-->3-->