Cicluri for

๐Ÿ”๐Ÿ”๐Ÿ”๐Ÿ”๐Ÿ”๐Ÿ”๐Ÿ”

  1. Calculaศ›i rฤƒsturnatul fiecฤƒrui numฤƒr din lista (Rฤƒsturnatul numฤƒrului 123 este 321.)

  2. Calculaศ›i ศ™i afiศ™aศ›i triplul fiecฤƒrui numฤƒr de la 1 la 100. (Ex: 3,6,9,12)

  3. Fie date numerele (3, 22, 8, 12, 45, -1, 19). Stocaศ›i-le รฎntr-o listฤƒ ศ™i determinaศ›i numฤƒrul minim ศ™i maxim, cu ciclu for.

  4. Printaศ›i urmฤƒtorul pattern:

*
* *
* * * 
* * * * 
* * * * * 
# Solutii
#1 

aList = [121, 562, 2989, 92538, 9281]
inverted_numbers = []
for n in aList:
    inverted_numbers.append(int(str(n)[::-1]))

#3 
numbers = [3, 22, 8, 12, 45, -1, 19]
minimum = None
maximum = None
for n in numbers:
    if maximum == None or maximum < n:
        maximum = n
    if minimum == None or minimum > n:
        minimum = n

print(minimum, maximum)    

Last updated