ListasEnlazadas/Circular.java at master · GrupoJava/ListasEnlazadas · 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
97
98
99
100
101
102
103
public class Circular<E> implements listaEnlazada<E>{

	Nodo<E> ultimo = null;
	int cont;

	public Circular(){

		cont = 0;

	}

	public int size() {
		return cont;
	}

	public void addFirst(E value) {
		Nodo<E> temp = new Nodo<E>(value);

		if (ultimo == null){

			ultimo = temp;
			ultimo.setNext(ultimo);

		}
		else
		{
			temp.setNext(ultimo.getNext());
			ultimo.setNext(temp);
		}


		cont++;
	}

	public E removeFirst() {

		Nodo<E> temp;
		Nodo<E> temp2;
		temp2 = ultimo.getNext();
		temp =  ultimo.getNext().getNext();
		ultimo.setNext(temp);
		return (E) temp2;
	}

	public E removeLast() {

		Nodo<E> pointer = ultimo;
		while (pointer.getNext()!= ultimo){
			pointer = pointer.getNext();
		}

		Nodo<E> temp = ultimo;

		if (pointer == ultimo){
			ultimo = null;
		}
		else
		{
			pointer.setNext(ultimo.getNext());
			ultimo = pointer;
		}

		cont--;
		return (E) temp;
	}

	public void addLast(E value) {
	}

	public E getFirst() {

		if (cont!=0){
			return (E) ultimo.getNext();
		}

		return null;
	}

	public E getLast() {

		Nodo<E> pointer = ultimo;
		while (pointer.getNext()!= ultimo){
			pointer = pointer.getNext();
		}

		return (E) pointer;
	}

	public boolean contains(E value) {
		int i = 0;
		Nodo<E> temp = ultimo;
		while (i<cont){

			if (temp== value){ return true; }
			i++;
		}

		return false;
	}


}