public class Solution {
public void reOrderArray(int [] array) {
int k = 0;
for (int i = 0; i < array.length; i++) {
if (array[i] % 2 != 0) {
int temp = array[i];
for (int j = i; j >= k+1; j--) {
array[j] = array[j-1];
}
array[k++] = temp;
}
}
}
}
调整数组顺序使奇数位于偶数前面
最新推荐文章于 2019-08-01 09:58:26 发布