文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
1. Description
Sort Array By Parity
2. Solution
解析：Version 1，使用前后双指针，每次左边的奇数都跟右边的偶数对换位置。
- Version 1
class Solution:
def sortArrayByParity(self, nums: List[int]) -> List[int]:
i = 0
j = len(nums) - 1
while i < j:
while i < len(nums) and nums[i] % 2 == 0:
i += 1
while j > -1 and nums[j] % 2 == 1:
j -= 1
if i < j:
nums[i], nums[j] = nums[j], nums[i]
return nums
网友评论