-
-
Save parzibyte/6d957999e5ca16a1a86f42925ae106c7 to your computer and use it in GitHub Desktop.
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
""" | |
https://parzibyte.me/blog | |
""" | |
def anagrama(palabra1, palabra2): | |
# Convertimos ambas a minúsculas | |
palabra1 = palabra1.lower() | |
palabra2 = palabra2.lower() | |
# Luego convertimos las cadenas a arreglos, porque vamos a ordenarlas pero es más sencillo ordenar un arreglo | |
palabra1_arreglo = list(palabra1) | |
palabra2_arreglo = list(palabra2) | |
# Las ordenamos | |
palabra1_arreglo.sort() | |
palabra2_arreglo.sort() | |
# Convertir de vuelta a cadena | |
palabra1_ordenada = "".join(palabra1_arreglo) | |
palabra2_ordenada = "".join(palabra2_arreglo) | |
# Y finalmente comprobar si son iguales | |
return palabra1_ordenada == palabra2_ordenada | |
cadena1 = "Nacionalista" | |
cadena2 = "Altisonancia" | |
es_anagrama = anagrama(cadena1, cadena2) | |
if es_anagrama: | |
print(f"{cadena1} es anagrama de {cadena2}") | |
else: | |
print(f"{cadena1} NO es anagrama de {cadena2}") | |
# Solicitar al usuario las cadenas | |
cadena1 = input("Ingresa una cadena: ") | |
cadena2 = input("Ingresa otra cadena: ") | |
es_anagrama = anagrama(cadena1, cadena2) | |
if es_anagrama: | |
print(f"{cadena1} es anagrama de {cadena2}") | |
else: | |
print(f"{cadena1} NO es anagrama de {cadena2}") |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment