generated from Andressep/java-codespace
-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
M4 Arreglos y Archivos D30 - Desafío guiado: Mirando el pasado
- Loading branch information
Showing
7 changed files
with
252 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
package D30; | ||
import java.util.Arrays; | ||
import java.util.HashSet; | ||
import java.util.Set; | ||
import java.util.TreeSet; | ||
|
||
public class CapitalesDelMundo { | ||
public static void main(String[] args) { | ||
Set<String> capitales = new TreeSet<>(); | ||
capitales.add("Buenos Aires"); | ||
capitales.add("Brasilia"); | ||
capitales.add("Asunción"); | ||
capitales.add("Lima"); | ||
Set<String> capitales2 = new HashSet<>(Arrays.asList("Caracas", "Bogotá", | ||
"Montevideo","Quito", "Brasilia")); | ||
Set<String> capitalesUnidas = new TreeSet<>(capitales); | ||
capitalesUnidas.addAll(capitales2); | ||
System.out.println(capitalesUnidas); | ||
|
||
Set<String> removerCapitales = new HashSet<>(capitales); | ||
removerCapitales.removeAll(capitales2); | ||
System.out.println(removerCapitales); | ||
|
||
Set<String> interseccionCapitales = new HashSet<>(capitales); | ||
interseccionCapitales.retainAll(capitales2); | ||
System.out.println(interseccionCapitales); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,29 @@ | ||
package D30; | ||
import java.util.LinkedList; | ||
import java.util.Queue; | ||
|
||
public class Continentes { | ||
public static void main(String[] args) { | ||
Queue continentes = new LinkedList<>(); | ||
continentes.add("África"); | ||
continentes.add("América"); | ||
continentes.add("Europa"); | ||
continentes.add("Oceanía"); | ||
continentes.add("Asia"); | ||
continentes.add("Antártica"); | ||
|
||
System.out.println(continentes.remove("Antártica")); | ||
System.out.println(continentes); | ||
|
||
System.out.println(continentes.poll()); | ||
System.out.println(continentes); | ||
|
||
System.out.println("peek : " + continentes.peek()); | ||
System.out.println(continentes); | ||
|
||
System.out.println("element: "+continentes.element()); | ||
System.out.println(continentes); | ||
|
||
System.out.println(continentes.size()); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,31 @@ | ||
package D30; | ||
import java.util.Map; | ||
import java.util.TreeMap; | ||
|
||
public class EjercicioGolosinas { | ||
public static void main(String[] args) { | ||
// 1. Instanciar un TreeMap<> llamado “golosinas” | ||
Map<String, Integer> golosinas = new TreeMap<>(); | ||
|
||
// 2. Agregar golosinas con precios | ||
golosinas.put("Chocman", 100); | ||
golosinas.put("Trululú", 100); | ||
golosinas.put("Centella", 100); | ||
golosinas.put("Kilate", 50); | ||
golosinas.put("Miti-miti", 30); | ||
golosinas.put("Traga Traga", 150); | ||
golosinas.put("Tabletón", 5); | ||
|
||
// Imprimir golosinas ordenadas por clave | ||
System.out.println("Golosinas originales:"); | ||
System.out.println(golosinas); | ||
|
||
// 3. Filtrar golosinas por precio menor a 100 pesos | ||
System.out.println("\nGolosinas con precio menor a 100 pesos:"); | ||
for (Map.Entry<String, Integer> entry : golosinas.entrySet()) { | ||
if (entry.getValue() < 100) { | ||
System.out.println(entry.getKey() + " - $" + entry.getValue()); | ||
} | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,43 @@ | ||
package D30; | ||
import java.util.Set; | ||
import java.util.TreeSet; | ||
|
||
public class EjercicioInvitados { | ||
public static void main(String[] args) { | ||
// 1. Instanciar un TreeSet<> llamado “invitados” | ||
Set<String> invitados = new TreeSet<>(); | ||
|
||
// 2. Agregar nombres al TreeSet | ||
invitados.add("Daniel"); | ||
invitados.add("Paola"); | ||
invitados.add("Facundo"); | ||
invitados.add("Pedro"); | ||
invitados.add("Jacinta"); | ||
invitados.add("Florencia"); | ||
invitados.add("Juan Pablo"); | ||
|
||
// Imprimir invitados ordenados | ||
System.out.println("Invitados originales:"); | ||
System.out.println(invitados); | ||
|
||
// 3. Crear un nuevo set para posibles invitados no deseados | ||
Set<String> posiblesNoDeseados = new TreeSet<>(); | ||
posiblesNoDeseados.add("Jorge"); | ||
posiblesNoDeseados.add("Francisco"); | ||
posiblesNoDeseados.add("Marcos"); | ||
|
||
// Agregar posibles no deseados al set principal | ||
invitados.addAll(posiblesNoDeseados); | ||
|
||
// Imprimir el listado final de invitados | ||
System.out.println("\nListado final de invitados:"); | ||
System.out.println(invitados); | ||
|
||
// 4. Eliminar a "Jorge" del listado de invitados | ||
invitados.remove("Jorge"); | ||
|
||
// Imprimir el listado final después de eliminar a "Jorge" | ||
System.out.println("\nListado final después de eliminar a Jorge:"); | ||
System.out.println(invitados); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,27 @@ | ||
package D30; | ||
|
||
import java.util.Queue; | ||
import java.util.LinkedList; | ||
|
||
public class EjercicioJuegos { | ||
public static void main(String[] args) { | ||
// 1. Instanciar un Queue<> llamado “juegos” con LinkedList() | ||
Queue<String> juegos = new LinkedList<>(); | ||
|
||
// 2. Agregar juegos al Queue | ||
juegos.offer("Tombo"); | ||
juegos.offer("Congelado"); | ||
juegos.offer("Quemaditas"); | ||
juegos.offer("Cachipún"); | ||
juegos.offer("Pillarse"); | ||
|
||
// 3. Contar y mostrar la cantidad de juegos encolados | ||
System.out.println("Cantidad de juegos en la lista: " + juegos.size()); | ||
|
||
// Mostrar los juegos encolados | ||
System.out.println("\nLista de juegos:"); | ||
while (!juegos.isEmpty()) { | ||
System.out.println(juegos.poll()); | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
package D30; | ||
import java.util.ArrayList; | ||
|
||
public class EjercicioMarcas { | ||
public static void main(String[] args) { | ||
// 1. Instanciar un ArrayList<> llamado “marcas” | ||
ArrayList<String> marcas = new ArrayList<>(); | ||
|
||
// 2. Agregar 10 marcas | ||
marcas.add("Sony"); | ||
marcas.add("Nokia"); | ||
marcas.add("Diadora"); | ||
marcas.add("Kodak"); | ||
marcas.add("Panasonic"); | ||
marcas.add("Sega"); | ||
marcas.add("Palm"); | ||
marcas.add("Compaq"); | ||
marcas.add("Motorola"); | ||
marcas.add("Xerox"); | ||
|
||
// Imprimir las marcas en consola | ||
System.out.println("Marcas originales:"); | ||
System.out.println(marcas); | ||
|
||
// 3. Agregar 3 marcas adicionales | ||
marcas.add("Blokbaster"); | ||
marcas.add("Carrefour"); | ||
marcas.add("Jetix"); | ||
|
||
// Imprimir el nuevo listado en consola | ||
System.out.println("\nNuevo listado con marcas adicionales:"); | ||
System.out.println(marcas); | ||
|
||
// 4. Corregir el nombre de "Blokbaster" a "Blockbuster" | ||
marcas.set(marcas.indexOf("Blokbaster"), "Blockbuster"); | ||
|
||
// Imprimir el listado corregido en consola | ||
System.out.println("\nListado corregido:"); | ||
System.out.println(marcas); | ||
|
||
// 5. Eliminar "Carrefour" del listado | ||
boolean removed = marcas.remove("Carrefour"); | ||
if (removed) { | ||
System.out.println("\nCarrefour eliminado correctamente:"); | ||
System.out.println(marcas); | ||
} else { | ||
System.out.println("\nCarrefour no encontrado en la lista."); | ||
} | ||
|
||
// 6. Crear una nueva ArrayList para posibles marcas y agregarlas | ||
ArrayList<String> posiblesMarcas = new ArrayList<>(); | ||
posiblesMarcas.add("Atari"); | ||
posiblesMarcas.add("Commodore"); | ||
|
||
// Agregar las posibles marcas a la lista principal | ||
marcas.addAll(posiblesMarcas); | ||
|
||
// 7. Contar y mostrar la cantidad de elementos en la lista | ||
System.out.println("\nCantidad de elementos en la lista de marcas: " + marcas.size()); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,33 @@ | ||
package D30; | ||
import java.util.Map; | ||
import java.util.TreeMap; | ||
|
||
public class Planetas { | ||
public static void main(String[] args) { | ||
Map<String, Integer> planetas = new TreeMap<>(); | ||
planetas.put("Mercurio", 10); | ||
planetas.put("Venus", 20); | ||
planetas.put("Marte", 15); | ||
planetas.put("Jupiter", 50); | ||
System.out.println(planetas); | ||
|
||
planetas.remove("Venus"); | ||
System.out.println(planetas); | ||
|
||
System.out.println(planetas.get("Jupiter")); | ||
|
||
|
||
System.out.println(planetas.containsKey("Tierra")); | ||
System.out.println(planetas.containsKey("Jupiter")); | ||
|
||
planetas.keySet().forEach(key -> System.out.println(key)); | ||
|
||
for (Map.Entry<String, Integer> entry : planetas.entrySet()) { | ||
String key = entry.getKey(); | ||
Integer value = entry.getValue(); | ||
System.out.println(key); | ||
System.out.println(value); | ||
} | ||
} | ||
} | ||
|