class Solution {
public int[] sortArrayByParityII(int[] nums) {
int j = 1;// 下标
for(int i = 0; i < nums.length - 1; i += 2){
if((nums[i] % 2) != 0){
while((nums[j] % 2) != 0) j += 2;
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
return nums;
}
}
922.按奇偶排序数组Ⅱ
最新推荐文章于 2025-07-18 16:07:40 发布