GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — python_test/test10.py at master · sinferwu/python_test

Expand file tree

/

test10.py

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
26 lines (21 loc) · 747 Bytes
/

test10.py

Copy path

File metadata and controls

26 lines (21 loc) · 747 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
# 练习函数式编程的sorted函数
L = [1, 5, 6, 9, -8, 7, -4, -1, 3, -5]
print(L)
# 排序不改变原来函数,生成一个新的列表
L = sorted(L)
print(L)
# 指定排序方式
L = [1, 5, 6, 9, -8, 7, -4, -1, 3, -5]
L = sorted(L, key=abs)
print(L)
s = ['dfs','Fds','tda','Eds']
print(s)
print(sorted(s))
print(sorted(s, key=str.lower))
# 反向排序
print(sorted(s, key=str.lower, reverse=True))
# 作业:假设我们用一组tuple表示学生名字和成绩,L = [('Bob', 75), ('Adam', 92), ('Bart', 66), ('Lisa', 88)],按名字进行排序
L = [('Bob', 75), ('Adam', 92), ('Bart', 66), ('Lisa', 88)]
print(sorted(L, key=lambda x: x[0]))
# 按成绩进行排序
print(sorted(L,key=lambda x: x[1]))
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.