zoukankan      html  css  js  c++  java
  • python期末考试复习

    期末考试复习

    补修的python跟着大一一起学,考试肯定不会出难,于是就敲了一些代码,把他们放到博客上,来记录一下

    代码都是一段一段的,且python代码不是很多,所以我都写到了一个文件里,作为练习

    # python期末考试编程题
    
    
    # 往文件写东西
    # fp = open(r'file/test.txt','a+')
    # print('hellow',file=fp)
    # fp.close()
    
    
    # x = list(range(500))
    # print(x)
    # for item in x:
    # 	t = 5**5
    # 	print(item) 
    
    # 优化上面代码
    # x = list(range(100))
    # t = 5**5
    # for item in x:
    # 	print(item)
    # 	print(t)
    
    
    
    # 生成随机数对偶数下标并降序排列,奇数下标不变
    # import random
    # x = [random.randint(0,100) for i in range(20)]
    # print(x)
    # y = x[::2]
    # print(y)
    # y.sort(reverse=True)
    # x[::2]=y
    # print(x)
    
    
    
    # def join(list,sep=None):
    # 	return (sep or ',').join(list)
    # print(join(['1','b','c'])) # 1,b,c
    # print(join(['1','b','c'],':')) # 1:b:c
    
    
    
    
    
    # def Sum(a,b=3,c=5):
    # 	return sum([a,b,c])
    # print(Sum(a=8,c=2))
    # print(Sum(8))
    # print(Sum(8,2))
    
    # # 13
    # # 16
    # # 15
    
    
    # def Sum(*p):
    # 	return sum(p)
    # print(Sum(3,5,8))
    # print(Sum(8))
    # print(Sum(8,2,10))
    # # 16
    # # 8
    # # 20
    
    
    
    # # 编写函数判断奇偶数
    # import math
    # def IsPrime(v):
    # 	n = int(math.sqrt(v)+1)
    # 	for i in range(2,n):
    # 		if v%i==0:
    # 			return 'No'
    
    # 		else:
    # 			return 'Yes'
    # print(IsPrime(21))
    
    
    
    # # 模拟内置sorted函数
    # def Sorted(v):
    # 	t=v[::]
    # 	r=[]
    # 	while t:
    # 		tt = min(t)
    # 		r.append(tt)
    # 		t.remove(tt)
    # 	return r
    # a = ['1','2','3','4','5','6','1','2','3','6','5']
    
    # print(Sorted(a))
    
    
    
    # # 生成10个随机数,对前十个升序,对后十个降序
    # import random
    # x = [random.randint(0,100) for i in range(20)]
    # print(x)
    # y=x[0:10]
    # y.sort() #原地排序 
    # x[0:10]=y
    # y=x[10:20]
    # y.sort(reverse=True)
    # x[10:20]=y
    # print(x)
    
    
    
    # # #判断是否为闰年
    # x=input('Please input an integer of 4 digit meaning the year:')
    # x=eval(x)
    # print(x)
    # if x%400==0 or (x%4 ==0 and not x%100==0):
    # 	print('Yes')
    # else:
    # 	print('No')
    
    
    
    # # 计算分段函数
    # x = input('Please input x:')
    # x = eval(x)
    # if x<0 or x>=20:
    # 	print(0)
    # elif 0<=x<=5:
    # 	print(x)
    # elif 5<=x<10:
    # 	print(3*x-5)
    # elif 10<=x<20:
    # 	print(0.5*x-2)
    
    
    
    
    # # 下列程序不能运行,因为是只读属性
    
    # class Test:
    # 	def _init_(self,value):
    # 		self._value=value
    # 	@property
    # 	def value(self):
    # 		return self._value
    # t = Test(3)
    # t.value = 5
    # print(t.value)
    
    
    
    
    # # 统计数字出现频率
    # import random
    # x = [random.randint(1,20) for i in range(50)]
    # #print(x)
    # r = dict()
    # #print(r)
    # for i in x:
    # 	r[i] = r.get(i,0)+1
    # #print(r)
    # for k,v in r.items():
    # 		print(k,v)
    
    
    
    # # 程序文件名
    # def main():
    # 	if __name__=='__main__':
    # 		print(1)
    # 	else:
    # 		print(2)
    # main()
    
    
    
    
    # a=[1,2,3,4]
    # print(a)
    # print(a[-4])
    
    
    
    
    # x= [111,2,33]
    # x=sorted([111,2,33])
    # key = lambda x: -len(str(x))
    # print(key)
    
    # print(max([1111,2,222]))
    
    
    
    # print((3,))
    # print({1,2,})
    # print([1,2,])
    
    
    
    # print([i for i in range(100)if i%13 == 0])
    
    
    # x=[1,3,5,7,1,2]
    # x[len(x)+2:]=[1,2]
    # print(x)
    
    
    # def expend_list(list,num):
    # 	if len(list)>num:
    # 		return
    # 	for i in range(1,):
    
    print(132+321)
    print('132'+'321')
    
  • 相关阅读:
    【转】Java中static关键字用法总结
    Java 几种showMessageDialog的表示
    反片语 UVA 156
    【转】本科生如何发表论文
    关于高考
    5-25 朋友圈
    【转】C语言中字符串输入的三种方法
    201508110842_《Javascript权威指南(第六版)——方法借用,私有状态,construct重构和工厂方法》(P225-233)
    201508061158_《移动开发之——样式链表》
    201508061129_《移动开发之——防止触摸移动导致整个界面“露底”》
  • 原文地址:https://www.cnblogs.com/ygjzs/p/12171706.html
Copyright © 2011-2022 走看看