FilesExpand file tree

 master

/

LinkedListFindMiddleNode.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

74 lines (68 loc) · 1.65 KB

 master

/

LinkedListFindMiddleNode.java

Copy path

Top

File metadata and controls

• Code
• Blame

74 lines (68 loc) · 1.65 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package misc;

import misc.LinkedList.Node;

public class LinkedListFindMiddleNode {

public static void main(String[] args) {

LinkedList.Node head = new LinkedList.Node(21);

LinkedList list = new LinkedList(head);

list.add(new LinkedList.Node(3));

list.add(new LinkedList.Node(37));

list.add(new LinkedList.Node(14));

list.add(new LinkedList.Node(89));

list.printList();

Node middle = list.findMiddleNode(head);

list.findMiddleNode(head);

System.out.println("Middle Node: "+ middle.data());

}

}

class LinkedList {

static class Node {

private int data;

private Node next;

public Node(int data) {

this.data = data;

}

public int data() {

return data;

}

public Node next() {

return next;

}

}

private Node head;

public LinkedList(Node head) {

this.head = head;

}

/** Java method to add an element to linked list */

public void add(Node node) {

Node current = head;

while (current != null) {

if (current.next == null) {

current.next = node;

break;

}

current = current.next;

}

}

/** Java method to print a singly linked list */

public void printList() {

Node node = head;

while (node != null) {

System.out.print(node.data() + " ");

node = node.next();

}

System.out.println(" ");

}

/** Java method to find middle node in linked list */

public Node findMiddleNode(Node head) {

Node slowPointer, fastPointer;

slowPointer = fastPointer = head;

while(fastPointer !=null) {

fastPointer = fastPointer.next;

if(fastPointer != null && fastPointer.next != null) {

slowPointer = slowPointer.next;

fastPointer = fastPointer.next;

}

}

return slowPointer;

}

}