Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
E
ejercicios-clase-02-datos
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Juan Manuel Moreno Perez
ejercicios-clase-02-datos
Commits
60e42b29
Commit
60e42b29
authored
4 years ago
by
Juan Manuel Moreno Perez
Browse files
Options
Downloads
Patches
Plain Diff
ejercicio 1
parent
e7d26218
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
ejercicio1.ipynb
+77
-0
77 additions, 0 deletions
ejercicio1.ipynb
with
77 additions
and
0 deletions
ejercicio1.ipynb
0 → 100644
+
77
−
0
View file @
60e42b29
{
"cells": [
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Nombre: Juan Manuel Moreno Pérez\n",
"# Usuario: morenoj"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"• Escriba un programa en python que acepte una lista de palabras separadas por guiones, e\n",
"imprima de vuelta las mismas palabras, sin repetición y nuevamente separadas por guiones,\n",
"después de ordenarlas alfabéticamente.\n",
"\n",
"Ejemplo de entrada: naranja-avión-melodía-tupla-avión\n",
"\n",
"Salida esperada: avión-melodía-naranja-tupla"
]
},
{
"cell_type": "code",
"execution_count": 37,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"naranja-avión-melodía-tupla-avión\n",
"avión-melodía-naranja-tupla\n"
]
}
],
"source": [
"txt=input()\n",
"txt=txt.split('-')\n",
"txt=sorted(txt)\n",
"prev=''\n",
"ret=''\n",
"for i in range(len(txt)):\n",
" if txt[i]==prev:\n",
" continue\n",
" else:\n",
" ret+=txt[i]\n",
" if i<len(txt)-1:\n",
" ret+='-'\n",
" prev=txt[i]\n",
"print(ret)"
]
}
],
"metadata": {
"kernelspec": {
"display_name": "Python 3",
"language": "python",
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.8.5"
}
},
"nbformat": 4,
"nbformat_minor": 4
}
%% Cell type:markdown id: tags:
# Nombre: Juan Manuel Moreno Pérez
# Usuario: morenoj
%% Cell type:markdown id: tags:
• Escriba un programa en python que acepte una lista de palabras separadas por guiones, e
imprima de vuelta las mismas palabras, sin repetición y nuevamente separadas por guiones,
después de ordenarlas alfabéticamente.
Ejemplo de entrada: naranja-avión-melodía-tupla-avión
Salida esperada: avión-melodía-naranja-tupla
%% Cell type:code id: tags:
```
python
txt
=
input
()
txt
=
txt
.
split
(
'
-
'
)
txt
=
sorted
(
txt
)
prev
=
''
ret
=
''
for
i
in
range
(
len
(
txt
)):
if
txt
[
i
]
==
prev
:
continue
else
:
ret
+=
txt
[
i
]
if
i
<
len
(
txt
)
-
1
:
ret
+=
'
-
'
prev
=
txt
[
i
]
print
(
ret
)
```
%% Output
naranja-avión-melodía-tupla-avión
avión-melodía-naranja-tupla
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment