剑指Offer21:调整数组顺序使奇数位于偶数前面(Golang/Python/C#)

原题连接：剑指Offer21:调整数组顺序使奇数位于偶数前面

• 时间复杂度O(N):N为数组nums长度，双指针i,j共同遍历整个数组。
• 空间复杂度O(1):双指针i,j使用常数大小的额外空间。

Golang

package main

import "fmt"

func exchange(nums []int) []int {
	if len(nums) == 0 {
		return []int{}
	}
	var i = 0
	var j = len(nums) - 1
	for ; i < j; {
		for ; i < j && nums[i]%2 == 1; {
			i++
		}
		for ; i < j && nums[j]%2 == 0; {
			j--
		}
		if i < j {
			tmp := nums[i]
			nums[i] = nums[j]
			nums[j] = tmp
		}
	}
	return nums
}

func main() {
	nums := []int{1, 2, 3, 4}
	fmt.Println(exchange(nums))
}

Python

from typing import List


class Solution:
    def exchange(self, nums: List[int]) -> List[int]:
        if not nums: return []
        i, j = 0, len(nums) - 1
        while i < j:
            while i < j and nums[i] % 2 == 1: i += 1
            while i < j and nums[j] % 2 == 0: j -= 1
            if i < j:
                nums[i], nums[j] = nums[j], nums[i]
        return nums


if __name__ == "__main__":
    nums = [1, 2, 3, 4]
    solution = Solution()
    print(solution.exchange(nums))

C#

public class Solution
{
    public int[] Exchange(int[] nums)
    {
        if (nums.Length == 0) {
            int[] ans = new int[0];
            return ans;
        }
        int i = 0;
        int j = nums.Length - 1;
        while (i < j) {
            while (i < j && nums[i] % 2 == 1) {
                i++;
            }
            while (i < j && nums[j] % 2 == 0) {
                j--;
            }
            if (i < j) {
                int tmp = nums[i];
                nums[i] = nums[j];
                nums[j] = tmp;
            }
        }
        return nums;
    }
}
class Program
{
    static void Main(string[] args)
    {
        int[] nums = { 1, 2, 3, 4 };
        Solution solution = new Solution();
        Console.WriteLine(String.Join(",", solution.Exchange(nums)));
    }
}