Leetcode 905. Sort Array By Parity
Posted SnailTyan
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode 905. Sort Array By Parity相关的知识,希望对你有一定的参考价值。
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
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
Reference
以上是关于Leetcode 905. Sort Array By Parity的主要内容,如果未能解决你的问题,请参考以下文章
leetcode905. Sort Array By Parity
Leetcode905 Sort Array By Parity
[leetcode][easy][Array][905][Sort Array By Parity]
Leetcode 905. Sort Array By Parity