class Solution:
def exchange(self, nums: List[int]) -> List[int]:
i,j = 0, len(nums)-1
while i<j:
while i<=j and nums[i]%2 != 0:
i+=1
while i<=j and nums[j]%2 == 0:
j-=1
if i<j:
nums[i],nums[j] = nums[j],nums[i]
i += 1
j -= 1
return nums
每日一道Leetcode - 剑指 Offer 21. 调整数组顺序使奇数位于偶数前面【双指针】
最新推荐文章于 2024-09-25 16:05:14 发布