- 方法一:边比较边移动,输出最大的元素。
class Solution:
def minArray(self, numbers: List[int]) -> int:
for i in range(0,len(numbers)-1):
if(numbers[i]<numbers[i+1]):
temp = []
temp = numbers[i]
numbers[i] = numbers[i+1]
numbers[i+1] = temp
return numbers[-1]