Sword finger offer 21. adjust the array order so that odd numbers precede even numbers

https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/

Their thinking ： Double finger needling

Left pointer left Traverse from left to right , Stop when an even number is encountered ; Right pointer left Traverse from right to left , Stop when an odd number is encountered ; Exchange the odd and even numbers encountered at the same time

class Solution {
    
    public int[] exchange(int[] nums) {
    
        int left=0,right=nums.length-1;
        while(left<right){
    
            while(left<right&&nums[left]%2==1){
    
                left++;
            }
            while(left<right&&nums[right]%2==0){
    
                right--;
            }
            swap(nums,left,right);
        }
        return nums;
    }
    public void swap(int[] nums,int i,int j){
    
        int tmp=nums[i];
        nums[i]=nums[j];
        nums[j]=tmp;
    }
}
//O(n)
//O(1)

class Solution {
    
public:
    vector<int> exchange(vector<int>& nums) {
    
        int l=0,r=nums.size()-1;
        while(l<r){
    
            while(l<r&&nums[l]%2==1){
    
                l++;
            }
            while(l<r&&nums[r]%2==0){
    
                r--;
            }
            swap(nums[l],nums[r]);
        }
        return nums;

    }
};

class Solution:
    def exchange(self, nums: List[int]) -> List[int]:
        left,right=0,len(nums)-1
        while left < right:
            while left<right and nums[left]%2==1:
                left+=1
            while left<right and nums[right]%2==0:
                right-=1
            nums[left],nums[right]=nums[right],nums[left]
        return nums