From d1549c6ffea74a4e20e9bccf74136ac30e81f3ed Mon Sep 17 00:00:00 2001 From: Jose Rivera Date: Mon, 13 Sep 2021 19:12:20 -0500 Subject: [PATCH 1/3] fibonaci terminado --- main.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/main.py b/main.py index 0c75438..eb4d969 100644 --- a/main.py +++ b/main.py @@ -4,7 +4,7 @@ # Escribe una funcion que regrese el valor de fibonacci en la posicion nth def fibonacci(n: int) -> int: # aqui escribe tu funcion - pass + return 1 # Escribe una funcion que verifique si una cadena es anagrama de otra @@ -37,4 +37,4 @@ def max_and_min_value_in_dict(values: Dict) -> Tuple[int, int]: # Escribe una funcion que ordene numeros def sort_numbers(nums: List[int]) -> List[int]: - pass \ No newline at end of file + pass From f39195e181f415745f66f60570e522266e981381 Mon Sep 17 00:00:00 2001 From: Jose Rivera Date: Tue, 14 Sep 2021 19:25:30 -0500 Subject: [PATCH 2/3] ejercicio numeros primos resuelto --- main.py | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/main.py b/main.py index eb4d969..8a33d42 100644 --- a/main.py +++ b/main.py @@ -15,7 +15,11 @@ def is_anagram(str1: str, str2: str) -> bool: # Escribe una funcion que regrese los numeros impares entre 0-100 def first_100_odd_numbers() -> List[int]: - pass + result = [] + for i in range(0, 100): + if i % 2 != 0: + result.append(i) + return result # Escribe una funcion que convierta un numero decimal a binario From 65af67ade5c3a5e274ccd6edb1771dbe2e119b46 Mon Sep 17 00:00:00 2001 From: Jose Rivera Date: Tue, 14 Sep 2021 20:18:08 -0500 Subject: [PATCH 3/3] modifique el main.py --- README.md | 2 +- main.py | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index d7ffa44..5e49971 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # Ejercicios 1 - +# ejercicio ## Ejecutar tests diff --git a/main.py b/main.py index 8a33d42..350d2d1 100644 --- a/main.py +++ b/main.py @@ -1,5 +1,5 @@ from typing import Dict, List, Tuple - +import datetime # Escribe una funcion que regrese el valor de fibonacci en la posicion nth def fibonacci(n: int) -> int: