comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2/README.md
面试题 21. 调整数组顺序使奇数位于偶数前面
题目描述
输入一个整数数组,实现一个函数来调整该数组中数字的顺序,使得所有奇数在数组的前半部分,所有偶数在数组的后半部分。
示例:
输入:nums = [1,2,3,4] 输出:[1,3,2,4] 注:[3,1,2,4] 也是正确的答案之一。
提示:
0 <= nums.length <= 50000
0 <= nums[i] <= 10000
解法
方法一:双指针
我们定义两个指针 i i i 和 j j j,其中指针 i i i 指向当前元素,指针 j j j 指向当前最后一个奇数的下一个位置。
接下来,我们从左到右遍历数组,当 n u m s [ i ] nums[i] nums[i] 是奇数时,我们将其与 n u m s [ j ] nums[j] nums[j] 交换,然后指针 j j j 向右移动一位。指针 i i i 每次向右移动一位,直到遍历完整个数组。
时间复杂度 O ( n ) O(n) O(n),空间复杂度 O ( 1 ) O(1) O(1)。其中 n n n 是数组的长度。
Python3
class Solution:
def exchange(self, nums: List[int]) -> List[int]:
j = 0
for i, x in enumerate(nums):
if x & 1:#把找到的奇数,从前向后替换
nums[i], nums[j] = nums[j], nums[i]
j += 1
return nums
Java
class Solution {
public int[] exchange(int[] nums) {
int j = 0;
for (int i = 0; i < nums.length; ++i) {
if (nums[i] % 2 == 1) {
int t = nums[i];
nums[i] = nums[j];
nums[j++] = t;
}
}
return nums;
}
}
C++
class Solution {
public:
vector<int> exchange(vector<int>& nums) {
int j = 0;
for (int i = 0; i < nums.size(); ++i) {
if (nums[i] & 1) {
swap(nums[i], nums[j++]);
}
}
return nums;
}
};
Go
func exchange(nums []int) []int {
j := 0
for i, x := range nums {
if x&1 == 1 {
nums[i], nums[j] = nums[j], nums[i]
j++
}
}
return nums
}
TypeScript
function exchange(nums: number[]): number[] {
let j = 0;
for (let i = 0; i < nums.length; ++i) {
if (nums[i] & 1) {
const t = nums[i];
nums[i] = nums[j];
nums[j++] = t;
}
}
return nums;
}
Rust
impl Solution {
pub fn exchange(mut nums: Vec<i32>) -> Vec<i32> {
let mut j = 0;
for i in 0..nums.len() {
if nums[i] % 2 == 1 {
nums.swap(i, j);
j += 1;
}
}
nums
}
}
JavaScript
/**
* @param {number[]} nums
* @return {number[]}
*/
var exchange = function (nums) {
let j = 0;
for (let i = 0; i < nums.length; ++i) {
if (nums[i] & 1) {
const t = nums[i];
nums[i] = nums[j];
nums[j++] = t;
}
}
return nums;
};
C#
public class Solution {
public int[] Exchange(int[] nums) {
int j = 0;
for (int i = 0; i < nums.Length; ++i) {
if (nums[i] % 2 == 1) {
int t = nums[i];
nums[i] = nums[j];
nums[j++] = t;
}
}
return nums;
}
}
Swift
class Solution {
func exchange(_ nums: [Int]) -> [Int] {
var nums = nums
var j = 0
for i in 0..<nums.count {
if nums[i] % 2 == 1 {
let temp = nums[i]
nums[i] = nums[j]
nums[j] = temp
j += 1
}
}
return nums
}
}