CB100

Notas, resueltos y tps de la materia Algoritmos y Estructuras de Datos
Index Commits Files Refs README
commit 5954e32990ab00bcfe072b8ba0ee5a413c9372ee
parent 21b5159c6d3b7e8157601962fde3525ff651f0b1
Author: Martin Kloeckner <mjkloeckner@gmail.com>
Date:   Fri, 21 Jun 2024 21:41:35 -0300

change format

Diffstat:
Mlist.h | 12++++++++----
1 file changed, 8 insertions(+), 4 deletions(-)
diff --git a/list.h b/list.h
@@ -138,7 +138,8 @@ template <typename Type> void List<Type>::validarPosicion(unsigned int posicion)
     }
 }
 
-template <typename Type> Node<Type> * List<Type>::obtenerNodo(unsigned int posicion) {
+template <typename Type> 
+Node<Type> *List<Type>::obtenerNodo(unsigned int posicion) {
     //validarPosicion(posicion);
     Node<Type> * actual = this->first;
     for(unsigned int i = 1; i < posicion; i++) {
@@ -147,17 +148,20 @@ template <typename Type> Node<Type> * List<Type>::obtenerNodo(unsigned int posic
     return actual;
 }
 
-template <typename Type> void List<Type>::remove(unsigned int posicion) {
+template <typename Type>
+void List<Type>::remove(unsigned int posicion) {
     validarPosicion(posicion);
-    Node<Type> * removido;
+    Node<Type> *removido;
+
     if (posicion == 1) {
         removido = this->first;
         this->first = removido->getNext();
     } else {
-        Node<Type> * anterior = this->obtenerNodo(posicion -1);
+        Node<Type> *anterior = this->obtenerNodo(posicion - 1);
         removido = anterior->getNext();
         anterior->setNext( removido->getNext());
     }
+
     delete removido;
     this->size--;
 }