Simple C++ Solution [TC: O(n)]
34
May 02, 2022
class Solution {
public:
    void swap(vector<int>& nums,int a,int b){
        int temp=nums[a];
        nums[a]=nums[b];
        nums[b]=temp;
    }
    vector<int> sortArrayByParity(vector<int>& nums) {
     int ptr=-1;
     for(int i=0;i<nums.size();i++){
         if(nums[i]%2==0){
             swap(nums,i,ptr+1);
             ptr++;
         }
     }
        return nums;
    }
};
Comments (0)