-
Notifications
You must be signed in to change notification settings - Fork 1
/
PointerTest.java
64 lines (63 loc) · 1.63 KB
/
PointerTest.java
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
public class PointersTest{
// Private Linked List to Store data.
public class LinkedList<E>{
private Node head;
private Tail tail;
private int size;
private class Node{
E data;
Node next;
Node prev;
public Node(E data, Node next, Node prev){
this.data = data;
this.next = next;
this.prev = prev;
}
}
public LinkedList(){
size = 0;
}
public int size(){return size;}
public boolean isEmpty(){return size == 0;}
public void addFirst(E element){
Node temp = new Node(element, head, null);
if(head != null){head.prev == temp;}
head = temp;
if(tail == null){ tail = temp;}
size++;
}
public void addLast(E element){
Node temp = new Node(element, null, tail);
if(head != null){ head.next == temp;}
tail = temp;
if(tail == null){head = temp;}
size++;
}
}
private LinkedList<String> dataList;
private ArrayList<Integer> pointersArray;
private ArrayList<Integer> resultSet;
public PointerTest(){
dataList = new LinkedList<String>();
pointerArray = new ArrayList<Integter>;
}
public PointersTest(E element, int p){
dataList = new LinkedList<String>();
pointerArray = new ArrayList<Integter>;
add(element, p);
}
public void add(E element , int p){
dataList.addLast(element);
pointerArray.add(p);
}
// Given when the input is sorted ( pointerArray is sorted).
public ArrayList<Integer> Consecutiveness(){
Node i =0; Node j =1; // Keep Track of pointers
resultSet = new ArrayList<Integer>();
while(i.next == j){
resultSet.add(i); resultSet.add(j);
i.next;j.next;
}
return resultSet;
}
}