- Python
P9999,求帮助
-
杨蕊繁Linda🐱🐉 (杨蕊繁)
LV 7
@
2023-2-4 21:21:23
def sort(numbers):
if len(numbers)==1 or len(numbers)==0:
return numbers
pivot=numbers[0]
right=[]
for i in range(1,len(numbers)):
if numbers[i]>pivot:
right.append(numbers[i])
left=[]
for i in range(1,len(numbers)):
if numbers[i]<=pivot:
left.append(numbers[i])
return sort(right)+sort(left)
numbers = eval(input())
sort(numbers)
2 条评论
-
冲榜模式 (马骁楠) LV 8 @ 2023-2-10 8:30:21已修改
这个题是 Python 进入 C++ 的学前测试的题吧！
没有写 log = print
其次是
return sort(left)+sort(right)
-
@ 2023-2-5 21:49:20
def sort(numbers): if len(numbers) <= 1: return numbers left = [] for i in range(1, len(numbers)): if numbers[i] > numbers[0]: left.append(numbers[i]) right = [] for i in range(1, len(numbers)): if numbers[i] <= numbers[0]: right.append(numbers[i]) return sort(???) + [numbers[0]] + sort(???) numbers = eval(input()) print(sort(numbers))有些还是要自己都脑筋
- 1