How leetCode adjusts the order of arrays when odd numbers precede even numbers

This article is about how the odd number comes before the even number when leetCode adjusts the array order. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.

First, adjust the array order so that the odd number is in front of the even number 1.

Enter an array of integers and implement a function to adjust the order of the numbers in the array so that all odd numbers are in the first half of the array and all even numbers are in the second half of the array.

2. Example description example:

Input: nums = [1, 2, 3, 4]

Output: [1, 3, 2, 4]

Note: [3, 1, 2, 4] is also one of the correct answers.

Tip:

1 1)

For (int I = 0; I

< nums.length; i++) { if ((nums[i] & 1) == 1) { oddList.add(nums[i]); } else { evenList.add(nums[i]); } } oddList.addAll(evenList); return oddList.stream().mapToInt(x ->

X) .toArray ()

}

}

Thank you for reading! This is the end of the article on "how leetCode adjusts the array order when odd numbers are in front of even numbers". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it out for more people to see!