解題思路
雙指針,p1指向頭,p2指向尾,p1在遇到偶數時停下,p2在遇到奇數時停下,如果此時p1<p2,則進行交換
代碼
class Solution {
public:
vector<int> exchange(vector<int>& nums) {
int p1 = 0, p2 = nums.size() - 1;
while (p1<p2)
{
while (p1 < p2 && (nums[p1] & 1) ) p1++;//p1所指爲奇數時
while (p1 < p2 && (nums[p2] & 1) == 0) p2--;//p2所指爲偶數時
if (p1 < p2) swap(nums[p1], nums[p2]);//p1<p2時
}
return nums;
}
};