leetcode 905. Sort Array By Parity 按奇偶排序数组-耗时100

Problem: 905. Sort Array By Parity 按奇偶排序数组

耗时100%，双指针，左侧拿到第一个奇数索引，右侧拿到第一个偶数索引，然后两者互换的

Code

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