实验任务1
task1.py
实验源码:
print(sum) sum = 42 print(sum) def inc(n): sum = n+1 print(sum) return sum sum = inc(7) + inc(7) print(sum)
运行测试截图:
答:不是同一个对象的名称。line1是内置作用域,line3、line11的sum是全局作用域,line7的sum是局部作用域
实验任务2
task2_1.py
实验源码:
def func1(a, b, c, d, e, f): return [a,b,c,d,e,f] def func2(a, b, c,*, d, e, f): return [a,b,c,d,e,f] def func3(a, b, c, /, d, e, f): return [a,b,c,d,e,f] print( func1(1,9,2,0,5,3) ) print( func1(a=1, b=9, c=2, d=0, e=5, f=3) ) print( func1(1,9,2, f=3, d=0, e=5)) print( func2(11, 99, 22, d=0, e=55, f=33) ) print( func2(a=11, b=99, c=22, d=0, e=55, f=33) ) print( func3(111, 999, 222, 0, 555, 333)) print( func3(111, 999, 222, d=0, e=555, f=333) )
运行测试截图:
task2_2.py
实验源码:
list1 = [1, 9, 8, 4] print( sorted(list1) ) print( sorted(list1, reverse=True) ) print( sorted(list1, True) )
运行测试截图:
答:内置函数sorted()中参数reverse一定要用关键字传递
task2_3.py
实验源码:
def func(a, b, c, /, *, d, e, f): return( [a,b,c,d,e,f] ) print(func(1,2,3,d=4,e=5,f=6))
运行测试截图:
实验任务3
task3.py
实验源码:
def solve(a, b, c): ''' 求解一元二次方程, 返回方程的两个根 :para: a,b,c: float 方程系数 :return: tuple ''' delta = b*b - 4*a*c delta_sqrt = abs(delta)**0.5 p1 = -b/2/a p2 = delta_sqrt/2/a if delta >= 0: root1 = p1 + p2 root2 = p1 - p2 else: root1 = complex(p1, p2) root2 = complex(p1, -p2) return root1, root2 print(solve.__doc__) while True: try: t = input('输入一元二次方程系数a b c, 或者,输入#结束: ') if t == '#': print('结束计算,退出') break a, b, c = map(float, t.split()) if a == 0: raise ValueError('a = 0, 不是一元二次方程') except ValueError as e: print(repr(e)) print() except: print('有其它错误发生\n') else: root1, root2 = solve(a, b, c) print(f'root1 = {root1:.2f}, root2 = {root2:.2f}') print()
运行测试截图:
实验任务4
task4.py
实验源码:
def list_generator(a,b,c=1): lst = [] while a<=b: lst.append(a) a += c return lst list1 = list_generator(-5, 5) print(list1) list2 = list_generator(-5, 5, 2) print(list2) list3 = list_generator(1, 5, 0.5) print(list3)
运行测试截图:
实验任务5
task5.py
实验源码:
def is_prime(n): if n == 2: return True elif n != 1: for i in range(2,n): if n == 2: return True elif n % i == 0: break else: return True for i in range(2,20+1,2): flag = True for j in range(2, i): if is_prime(j) == True and is_prime(i - j) == True and flag == True: print(f'{i}={j}+{i-j}') flag = False
运行测试截图:
实验任务6
task6.py
实验源码:
def encoder(text): new_text1 = '' for i in text: if 'a' <= i <='z': i = chr((ord(i)-97+5)%26 + 97) new_text1 += i elif 'A' <= i <= 'Z': i = chr((ord(i)-65+5)%26 + 65) new_text1 += i else:new_text1 += i return new_text1 def decoder(text): new_text2 = '' for i in text: if 'a' <= i <='z': i = chr((ord(i)-97-5)%26 + 97) new_text2 += i elif 'A' <= i <= 'Z': i = chr((ord(i)-65-5)%26 + 65) new_text2 += i else:new_text2 += i return new_text2
运行测试截图:
实验任务7
task7.py
实验源码:
def collatz(n): lst = [] lst.append(n) while n != 1: if n %2 == 0: n = n/2 lst.append(int(n)) else: n = n*3 +1 lst.append(int(n)) return lst try: n = int(input('Enter a positive integer:')) if n <= 0: raise ValueError except ValueError: print('Error: must be a positive integer') else: print(collatz(n))
运行测试截图:
实验任务8
task8.py
实验源码:
def func(n): if n == 0: return 0 else: return 2*func(n-1) + 1 while True: x = input() if x == '#': print('计算结束') break n = int(x) ans = func(n) print(f'n = {n}, ans = {ans}')
运行测试截图:
标签:return,函数,编程,源码,实验,print,True,def From: https://www.cnblogs.com/sxy59e/p/17408167.html