1、Python列表排序 reverse、sort、sorted 操作方法详解
reverse（倒序/反转）
>>>
>>> x=[1,2,3,4]
>>> x.reverse()
>>> print x
[4, 3, 2, 1]
>>>
sort(正序/小到大)
>>>
>>> y=[0,5,2,7]
>>> y.sort()
>>> print y
[0, 2, 5, 7]
>>>
sorted(即可以保留原列表，又能得到已经排序好的列表)
>>> z=[1,3,5,2,4]
>>> a=sorted(z)
>>> print z
[1, 3, 5, 2, 4]
>>> print a
[1, 2, 3, 4, 5]
>>>
输入的数字按小到大排序
[root@python ~]# cat a.py
| 12345678 | #!/usr/bin/python#-*- coding:utf-8 -*-number1=int(raw_input("please input your number:"))number2=int(raw_input("please input your number:"))number3=int(raw_input("please input your number:"))number=[number1,number2,number3]number.sort()print number |
结果：
[root@python ~]# python a.py
please input your number:5please input your number:2please input your number:6[2, 5, 6] |
2、计算1到100内的奇数和
解法1
| 12345678 | #!/usr/bin/python#-*- coding: utf-8 -*-i=1sum=0while(i<100):sum=sum+ii=i+2print sum |
解法2
#!/usr/bin/python#-*- coding: utf-8 -*-i=1sum=0while(i<100):if (i % 2 ==1):sum=sum+ii=i+2print sum |
结果：2500
同理-------------------
计算1到100内的偶数和
#!/usr/bin/pythona=0sum=0while(a<=100): sum=sum+a a=a+2print sum |
结果：2550
3、九九乘法表
[root@python ~]# cat a.py
#!/usr/bin/pythoni = 1while (i<=9): j=1 while (j<=i): print j,"x",i,"=", j*i, "\t ", j+=1 print " " i+=1 |
结果：
[root@python ~]# python a.py
1 x 1 = 1 1 x 2 = 2 2 x 2 = 4 1 x 3 = 3 2 x 3 = 6 3 x 3 = 9 1 x 4 = 4 2 x 4 = 8 3 x 4 = 12 4 x 4 = 16 1 x 5 = 5 2 x 5 = 10 3 x 5 = 15 4 x 5 = 20 5 x 5 = 25 1 x 6 = 6 2 x 6 = 12 3 x 6 = 18 4 x 6 = 24 5 x 6 = 30 6 x 6 = 36 1 x 7 = 7 2 x 7 = 14 3 x 7 = 21 4 x 7 = 28 5 x 7 = 35 6 x 7 = 42 7 x 7 = 49 1 x 8 = 8 2 x 8 = 16 3 x 8 = 24 4 x 8 = 32 5 x 8 = 40 6 x 8 = 48 7 x 8 = 56 8 x 8 = 64 1 x 9 = 9 2 x 9 = 18 3 x 9 = 27 4 x 9 = 36 5 x 9 = 45 6 x 9 = 54 7 x 9 = 63 8 x 9 = 72 9 x 9 = 81 |