Skip to content

Commit 61662b5

Browse files
committed
update: add doctest
1 parent 99900e5 commit 61662b5

File tree

7 files changed

+7
-13
lines changed

7 files changed

+7
-13
lines changed

.gitmodules

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
[submodule "Python-programming-exercises"]
2-
path = Python-programming-exercises
3-
url = https://github.com/zhiwehu/Python-programming-exercises.git
1+
[submodule "my-100-python-challenging-programming-exercises"]
2+
path = my-100-python-challenging-programming-exercises
3+
url = https://github.com/Thiswind-Learning/my-100-python-challenging-programming-exercises.git

my_exercises/question_02.py

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -18,9 +18,6 @@ def solution(input):
1818
40320
1919
2020
21-
Test:
22-
>>> solution(8)
23-
40320
2421
2522
"""
2623
pass

my_exercises/question_03.py

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -17,9 +17,6 @@ def solution(input):
1717
{1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64}
1818
1919
20-
Test:
21-
>>> solution(8)
22-
{1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64}
2320
2421
"""
2522
pass

my_exercises/question_09.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,8 +8,7 @@ def solution(input):
88
Question 9
99
1010
Level 2
11-
12-
Question:
11+
Question£º
1312
Write a program that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized.
1413
Suppose the following input is supplied to the program:
1514
Hello world
@@ -18,6 +17,7 @@ def solution(input):
1817
HELLO WORLD
1918
PRACTICE MAKES PERFECT
2019
20+
2121
2222
2323
"""

my_exercises/question_21.py

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,6 @@ def solution(input):
1515
DOWN 3
1616
LEFT 3
1717
RIGHT 2
18-
¡­
1918
The numbers after the direction are steps. Please write a program to compute the distance from current position after a sequence of movement and original point. If the distance is a float, then just print the nearest integer.
2019
Example:
2120
If the following tuples are given as input to the program:

my_python_exercises.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ def solution(input):
2525
'''
2626
tempate: Template = Template(template_str)
2727

28-
questions_file_name: str = 'Python-programming-exercises/100+ Python challenging programming exercises.txt'
28+
questions_file_name: str = 'my-100-python-challenging-programming-exercises/My-100-Python-challenging-programming-exercises.txt'
2929
questions_file_title_offset: int = 2
3030
dist_dir_name: str = 'my_exercises'
3131

0 commit comments

Comments
 (0)