Partition Array by Odd and Even

最新推荐文章于 2022-05-08 00:37:39 发布

zjj2015

最新推荐文章于 2022-05-08 00:37:39 发布

阅读量297

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/zjj2015/article/details/50776492

算法专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种将整数数组按奇数在前、偶数在后的顺序进行重新排列的方法。通过双指针技巧实现原地排序，无需额外空间。示例：输入 [1,2,3,4]，输出 [1,3,2,4]。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Partition Array by Odd and Even

Partition an integers array into odd number first and even number second.

Have you met this question in a real interview? Yes
Example
Challenge
Tags
Related Problems
Notes
Given [1, 2, 3, 4], return [1, 3, 2, 4]

public class Solution {  
    /** 
     * @param nums: an array of integers 
     * @return: nothing 
     */  
    public void partitionArray(int[] nums) {  
        int posOdd = 0, posEven = nums.length - 1;  
        while(true) {  
            while(posOdd < nums.length && nums[posOdd] % 2 == 1) posOdd++; //左边的奇数不动.偶数向右
            while(posEven >= 0 && nums[posEven] % 2 == 0) posEven--;  //右边的偶数不动,奇数向左
            if(posOdd >= posEven) return;  
            else {  
                int tmp = nums[posEven];  
                nums[posEven] = nums[posOdd];  
                nums[posOdd] = tmp;  
            }  
        }  
    }  
}