def func(n) :
s = 0
if isinstance(n, list):
for i in n:
s = s + i
return s
C = 1
if isinstance(n, tuple):
for j in n:
C = C * j
return C
L = [1, 3, 5, 7, 9, 10]
T = (3, 5, 7, 9)
print(func(L))
print(func(T))
s = 0
if isinstance(n, list):
for i in n:
s = s + i
return s
C = 1
if isinstance(n, tuple):
for j in n:
C = C * j
return C
L = [1, 3, 5, 7, 9, 10]
T = (3, 5, 7, 9)
print(func(L))
print(func(T))
2024-08-06
sum = 0
i = 1
while i <= 100:
sum = sum + i
i = i + 1
print(sum)
def S(n):
if n == 1:
return 1
return n+S(n-1)
print(S(100))
i = 1
while i <= 100:
sum = sum + i
i = i + 1
print(sum)
def S(n):
if n == 1:
return 1
return n+S(n-1)
print(S(100))
2024-08-06
L = []
a = 1
while a <= 100:
L.append(a*a)
a = a + 1
print(sum(L))
a = 1
while a <= 100:
L.append(a*a)
a = a + 1
print(sum(L))
2024-08-05
在該任務(wù)中,因為Python把0、空字符串和None看成False,其他數(shù)值和非空字符串都看成True,所以變量a是True,變量b是False,按照短路計算2規(guī)則可知第一個打印結(jié)果為('hello','python'),第二個打印結(jié)果為('hello','world')。
2024-08-01
print(3.1415926
'Learn Python in imooc.'
100
0b1101)
'Learn Python in imooc.'
100
0b1101)
2024-07-26
p=int(input("Put an even number \n I will give you the sum of this even columns from 0 to it"))
s=0
n=0
while n<=p:
n=n+1
if n%2!=0:
continue
s=s+n
print(s)
s=0
n=0
while n<=p:
n=n+1
if n%2!=0:
continue
s=s+n
print(s)
2024-07-26
#coding:utf-8
# Enter a code
T_1 = (1, 'CH', [3, 4]) #--> (1, 'CH', (3, 4))
#要把可變的tuple變?yōu)椴豢勺兊膖uple,就是要把tuple中類型為list的元素修改為tuple
#因此:我們就要先把可變的tuple修改為list,記作List
List = list(T_1)
#再把List中的list修改為tuple
List[2] = tuple(List[2])
#最后再把List修改回tuple
T_3 = tuple(List)
#輸出(1, 'CH', (3, 4))
print(T_3)
# Enter a code
T_1 = (1, 'CH', [3, 4]) #--> (1, 'CH', (3, 4))
#要把可變的tuple變?yōu)椴豢勺兊膖uple,就是要把tuple中類型為list的元素修改為tuple
#因此:我們就要先把可變的tuple修改為list,記作List
List = list(T_1)
#再把List中的list修改為tuple
List[2] = tuple(List[2])
#最后再把List修改回tuple
T_3 = tuple(List)
#輸出(1, 'CH', (3, 4))
print(T_3)
2024-07-10
#請分別使用循環(huán)和遞歸的形式定義函數(shù),求出1~100的和
def tSum(n):
i = 0
result = 0
while i <= n:
result += i
i += 1
return result
print(tSum(100))
def fSum(n):
if n == 1:
return 1
return fSum(n-1) + n
print(fSum(100))
def tSum(n):
i = 0
result = 0
while i <= n:
result += i
i += 1
return result
print(tSum(100))
def fSum(n):
if n == 1:
return 1
return fSum(n-1) + n
print(fSum(100))
2024-07-06