-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathFindMiddleLinkedList.java
More file actions
40 lines (34 loc) · 1.05 KB
/
FindMiddleLinkedList.java
File metadata and controls
40 lines (34 loc) · 1.05 KB
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
import java.util.Iterator;
import java.util.LinkedList;
/**
* This program finds the middle node of a singly LinkedList<AnyDataType>
* Created by Devang on 11-Jan-17.
*/
public class FindMiddleLinkedList {
public static void main(String[] args) {
LinkedList<String> myList = new LinkedList<>();
myList.add("a");
myList.add("b");
myList.add("c");
myList.add("d");
myList.add("e");
myList.add("f");
myList.add("g");
myList.add("h");
myList.add("i");
System.out.println(myList);
System.out.println(findMiddle(myList));
}
private static Object findMiddle(LinkedList myList){
Iterator slowPointer = myList.iterator();
Iterator fastPointer = myList.iterator();
while(fastPointer.hasNext()){
fastPointer.next();
if(fastPointer.hasNext()){
fastPointer.next();
slowPointer.next();
}
}
return slowPointer.next();
}
}