Skip to content
  • P
    Projects
  • G
    Groups
  • S
    Snippets
  • Help

bellcode / lesson6-5-2

  • This project
    • Loading...
  • Sign in
Go to a project
  • Project
  • Repository
  • Issues 0
  • Merge Requests 0
  • Pipelines
  • Wiki
  • Snippets
  • Members
  • Activity
  • Graph
  • Charts
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
  • Files
  • Commits
  • Branches
  • Tags
  • Contributors
  • Graph
  • Compare
  • Charts
Commit 2d945858 authored 2 years ago by BellCodeEditor's avatar BellCodeEditor
Browse files
Options
  • Browse Files
  • Download
  • Email Patches
  • Plain Diff

save project

parent 90c6fbf0 c266556l803p219a8311/wx607566
Hide whitespace changes
Inline Side-by-side
Showing with 9 additions and 21 deletions
  • 1.py
  • diy.py
1.py 0 → 100644
View file @ 2d945858
student=["悟空","小贝","八戒","波奇"]
students.pop(2)
print(student)
student.append("诺一")
print(students)
red=students[0:2]
blue=students[2:4]
print(blue)
\ No newline at end of file
This diff is collapsed. Click to expand it.
diy.py deleted 100644 → 0
View file @ 90c6fbf0
# 古代测量臂力是靠不同重量的石锁,只能测整数哦。
# 最小的石锁是30公斤最大的石锁是100公斤,注意输入的数字哦。
# 请优化刚刚的代码,并增添交互效果,和自动输出最强三人信息的功能~
# 问询处
name=input("你叫什么"")
power=int(input("你臂力值多少"))
# 归档处
hero=['赵一',30,'丁二',37,'孙五',52,'王猛',89,'周亮',98,'张宇',100]
for i in range(len(hero)):
if i%2==1 and hero[i]>=power:
hero.inert(i-1,name)
hero.insert(i,power)
print(hero[-6:])
# 打印出臂力最强的三个人和他们对应的臂力值:
This diff is collapsed. Click to expand it.
  • Write
  • Preview
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment