题解 | #排序#
排序
http://www.nowcoder.com/practice/2baf799ea0594abd974d37139de27896
python3 冒泡排序法
def MySort(self , arr: List[int]) -> List[int]:
# write code here
n=len(arr)
for i in range(0,n):
for j in range(i+1,n):
if arr[j]<arr[i]:
k=arr[i]
arr[i]=arr[j]
arr[j]=k
return arr
查看15道真题和解析