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.
Merge pull request #10 from Vinceto/developer
M4 Flujos Ciclos y Metodos D12
- Loading branch information
Showing
12 changed files
with
441 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,44 @@ | ||
package D12; | ||
|
||
import Util.SScan; | ||
|
||
public class Patrones { | ||
public static void main(String[] args) { | ||
SScan sscan = new SScan(); | ||
|
||
patron1(sscan); | ||
patron2(sscan); | ||
patron3(sscan); | ||
|
||
sscan.close(); | ||
} | ||
private static void patron1(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 1: "); | ||
// *.*.*.*.*.*.* | ||
int n = (int) sscan.escanear("int"); | ||
crearPatron(n, ".","*"); | ||
System.out.println(); | ||
} | ||
private static void patron2(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 2: "); | ||
// 12341234 | ||
int n = (int) sscan.escanear("int"); | ||
crearPatron(n, "1234","1234"); | ||
System.out.println(); | ||
} | ||
private static void patron3(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 3: "); | ||
// ||*||*||*||* | ||
int n = (int) sscan.escanear("int"); | ||
crearPatron(n, "*","||"); | ||
} | ||
static void crearPatron(int n, String patronPar, String patronImpar){ | ||
for (int i = 0; i < n; i++) { | ||
if(i % 2 != 0){ | ||
System.out.print(patronPar); | ||
}else{ | ||
System.out.print(patronImpar); | ||
} | ||
} | ||
} | ||
} |
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,98 @@ | ||
package D12; | ||
|
||
import Util.SScan; | ||
|
||
public class PatronesAnidados { | ||
public static void main(String[] args) { | ||
SScan sscan = new SScan(); | ||
|
||
patron1(sscan); | ||
patron2(sscan); | ||
patron3(sscan); | ||
patron4(sscan); | ||
|
||
sscan.close(); | ||
} | ||
|
||
private static void patron1(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 1: "); | ||
int n = (int) sscan.escanear("int"); | ||
for (int i = 0; i < n; i++) { | ||
for (int j = 0; j < n; j++) { | ||
if (i == 0 || i == n - 1 || j == 0 || j == n - 1) { | ||
System.out.print("*"); | ||
} else { | ||
System.out.print(" "); | ||
} | ||
} | ||
System.out.println(); | ||
} | ||
System.out.println(); | ||
} | ||
|
||
private static void patron2(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 2: "); | ||
int n = (int) sscan.escanear("int"); | ||
|
||
if (n == 1) { | ||
System.out.println("*"); | ||
return; | ||
} | ||
|
||
|
||
for (int i = 0; i < n; i++) { | ||
System.out.print("*"); | ||
} | ||
System.out.println(); | ||
|
||
for (int i = 1; i < n - 1; i++) { | ||
for (int j = 0; j < n; j++) { | ||
if (j == n - i - 1) { | ||
System.out.print("*"); | ||
} else { | ||
System.out.print(" "); | ||
} | ||
} | ||
System.out.println(); | ||
} | ||
|
||
for (int i = 0; i < n; i++) { | ||
System.out.print("*"); | ||
} | ||
System.out.println(); | ||
} | ||
|
||
private static void patron3(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 3: "); | ||
int n = (int) sscan.escanear("int"); | ||
|
||
for (int i = 0; i < n; i++) { | ||
for (int j = 0; j < n; j++) { | ||
if (i == j || i + j == n - 1) { | ||
System.out.print("x"); | ||
} else { | ||
System.out.print(" "); | ||
} | ||
} | ||
System.out.println(); | ||
} | ||
System.out.println(); | ||
} | ||
|
||
private static void patron4(SScan sscan) { | ||
System.out.println("Ingrese el tamaño del patron 4: "); | ||
int n = (int) sscan.escanear("int"); | ||
for (int i = 0; i < n; i++) { | ||
for (int j = 0; j < n; j++) { | ||
if (i == 0 && j == 0 || (i == n - 1 && j == n - 1) || (j > 0 && j < n - 1)) { | ||
System.out.print("*"); | ||
} else { | ||
System.out.print(" "); | ||
} | ||
} | ||
System.out.println(); | ||
} | ||
System.out.println(); | ||
} | ||
|
||
} |
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,25 @@ | ||
package D15; | ||
|
||
import java.util.ArrayList; | ||
import java.util.Collections; | ||
|
||
public class ArrayListMethods { | ||
public static void main(String[] args) { | ||
ArrayList<Double> notas = new ArrayList<Double>(); | ||
notas.add(4.7); | ||
notas.add(2.2); | ||
notas.add(5.4); | ||
notas.add(6.9); | ||
notas.add(4.4); | ||
notas.add(2.6); | ||
|
||
mostrarNotaMaximaYMinima(notas); | ||
} | ||
|
||
public static void mostrarNotaMaximaYMinima(ArrayList<Double> notas) { | ||
double maxNota = Collections.max(notas); | ||
double minNota = Collections.min(notas); | ||
System.out.println("Nota máxima: " + maxNota); | ||
System.out.println("Nota mínima: " + minNota); | ||
} | ||
} |
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,25 @@ | ||
package D15; | ||
|
||
import java.util.ArrayList; | ||
|
||
public class ArrayListOperations { | ||
public static void main(String[] args) { | ||
ArrayList<String> elementos = new ArrayList<String>(); | ||
elementos.add("mesa"); | ||
elementos.add("Refrigerador"); | ||
elementos.add("Cocina"); | ||
elementos.add("lavadora"); | ||
|
||
agregarElemento(elementos, "Silla"); | ||
agregarElemento(elementos, "Cocina"); // Este elemento ya existe | ||
} | ||
|
||
public static void agregarElemento(ArrayList<String> lista, String elemento) { | ||
if (lista.contains(elemento)) { | ||
System.out.println("Elemento "+elemento+" ya existe"); | ||
} else { | ||
lista.add(elemento); | ||
System.out.println("Elemento agregado: " + elemento); | ||
} | ||
} | ||
} |
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 D15; | ||
|
||
import java.util.ArrayList; | ||
|
||
public class ArrayListSearch { | ||
public static void main(String[] args) { | ||
ArrayList<String> nombres = new ArrayList<String>(); | ||
nombres.add("Pedro"); | ||
nombres.add("Juan"); | ||
nombres.add("Maria"); | ||
nombres.add("Ana"); | ||
nombres.add("Luis"); | ||
|
||
buscarYEliminar(nombres, "Maria"); | ||
buscarYEliminar(nombres, "Carlos"); | ||
} | ||
|
||
public static void buscarYEliminar(ArrayList<String> lista, String nombre) { | ||
if (lista.contains(nombre)) { | ||
System.out.println("Elemento encontrado: " + nombre); | ||
} else { | ||
System.out.println("Elemento no encontrado: " + nombre); | ||
lista.removeIf(n -> n.equals(nombre)); | ||
System.out.println("Lista después de la eliminación: " + lista); | ||
} | ||
} | ||
} |
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,21 @@ | ||
package D15; | ||
|
||
public class ArraysIntro { | ||
public static void main(String[] args) { | ||
int[] sueldos = {400000, 760000, 1100000, 650000, 654980, 987300, 700450, 442300}; | ||
double promedio = calcularPromedioSueldos(sueldos); | ||
System.out.println("El promedio de los sueldos mayores a 500000 es: " + promedio); | ||
} | ||
|
||
public static double calcularPromedioSueldos(int[] sueldos) { | ||
int suma = 0; | ||
int contador = 0; | ||
for (int sueldo : sueldos) { | ||
if (sueldo > 500000) { | ||
suma += sueldo; | ||
contador++; | ||
} | ||
} | ||
return contador == 0 ? 0 : (double) suma / contador; | ||
} | ||
} |
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,22 @@ | ||
package D15; | ||
|
||
public class MultiplosDeTres { | ||
public static void main(String[] args) { | ||
int[] numeros = new int[args.length]; | ||
for (int i = 0; i < args.length; i++) { | ||
numeros[i] = Integer.parseInt(args[i]); | ||
} | ||
int sumaMultiplos = suma(numeros); | ||
System.out.println("sumaMultiplos : "+sumaMultiplos); | ||
} | ||
|
||
public static int suma(int[] numeros) { | ||
int suma = 0; | ||
for (int numero : numeros) { | ||
if (numero % 3 == 0) { | ||
suma += numero; | ||
} | ||
} | ||
return suma; | ||
} | ||
} |
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,36 @@ | ||
package D15; | ||
|
||
public class MultiplosDeTresConPromedio { | ||
public static void main(String[] args) { | ||
int[] numeros = new int[args.length]; | ||
for (int i = 0; i < args.length; i++) { | ||
numeros[i] = Integer.parseInt(args[i]); | ||
} | ||
int sumaMultiplos = suma(numeros); | ||
double promedioMultiplos = promedio(numeros); | ||
System.out.println("sumaMultiplos : "+sumaMultiplos); | ||
System.out.println("promedioMultiplos : "+promedioMultiplos); | ||
} | ||
|
||
public static int suma(int[] numeros) { | ||
int suma = 0; | ||
for (int numero : numeros) { | ||
if (numero % 3 == 0) { | ||
suma += numero; | ||
} | ||
} | ||
return suma; | ||
} | ||
|
||
public static double promedio(int[] numeros) { | ||
int suma = 0; | ||
int contador = 0; | ||
for (int numero : numeros) { | ||
if (numero % 3 == 0) { | ||
suma += numero; | ||
contador++; | ||
} | ||
} | ||
return contador == 0 ? 0 : (double) suma / contador; | ||
} | ||
} |
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,35 @@ | ||
package D15; | ||
import java.util.ArrayList; | ||
import java.util.List; | ||
public class SmartWatch { | ||
public static void main(String[] args) { | ||
List<Integer> pasos = new ArrayList<>(); | ||
for (String arg : args) { | ||
pasos.add(Integer.parseInt(arg)); | ||
} | ||
List<Integer> pasosFiltrados = clearSteps(pasos); | ||
double promedioPasos = promedio(pasosFiltrados); | ||
System.out.println("Promedio de pasos : "+promedioPasos); | ||
} | ||
|
||
public static List<Integer> clearSteps(List<Integer> pasos) { | ||
List<Integer> filtrados = new ArrayList<>(); | ||
for (int paso : pasos) { | ||
if (paso >= 200 && paso <= 100000) { | ||
filtrados.add(paso); | ||
}else{ | ||
System.out.println("valor descartado : "+paso); | ||
} | ||
} | ||
return filtrados; | ||
} | ||
|
||
public static double promedio(List<Integer> pasos) { | ||
int suma = 0; | ||
for (int paso : pasos) { | ||
suma += paso; | ||
System.out.println("pasos a sumar : "+paso); | ||
} | ||
return pasos.size() == 0 ? 0 : (double) suma / pasos.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,21 @@ | ||
package D15; | ||
|
||
public class Visitas { | ||
public static void main(String[] args) { | ||
int[] visitas = new int[args.length]; | ||
for (int i = 0; i < args.length; i++) { | ||
visitas[i] = Integer.parseInt(args[i]); | ||
System.out.println("visita "+i+" : "+visitas[i]); | ||
} | ||
double promedioVisitas = promedio(visitas); | ||
System.out.println("El promedio de visitas es: "+promedioVisitas); | ||
} | ||
|
||
public static double promedio(int[] visitas) { | ||
int suma = 0; | ||
for (int visita : visitas) { | ||
suma += visita; | ||
} | ||
return visitas.length == 0 ? 0 : (double) suma / visitas.length; | ||
} | ||
} |
Oops, something went wrong.