LeetCode-剑指 Offer 21. 调整数组顺序使奇数位于偶数前面

直接看代码吧，很简单的

class Solution:
    def exchange(self, nums: List[int]) -> List[int]:
        n = len(nums)
        i, j = 0, n-1
        while i < j:
            while (i < j and (nums[i] & 1) == 1): i += 1
            while (i < j and (nums[j] & 1) == 0): j -= 1
            nums[i], nums[j] = nums[j], nums[i]
        return nums